diff --git a/src/solution/Solution.java b/src/solution/Solution.java
index 66ccc6b..a2113ad 100644
--- a/src/solution/Solution.java
+++ b/src/solution/Solution.java
@@ -81,28 +81,29 @@ public class Solution {
     }
     //合并数组冒泡排序实现
     public static void merge(int[] nums1, int m, int[] nums2, int n) {
-        int[] nums= new int[m + n];
-        for (int i = 0; i < m + n; i++) {
-            if (i < m){
-                nums[i] = nums1[i];
-            } else {
-                nums[i] = nums2[i - m];
-            }
-        }
+        System.arraycopy(nums2, 0, nums1, m, n);
         // 冒泡排序
-        for (int i = 0; i < nums.length; i++) {
-            for (int j = 0; j < nums.length; j++) {
+        for (int i = 0; i < nums1.length; i++) {
+            for (int j = 0; j < nums1.length; j++) {
                 if (i != j) {
-                    if (nums[i] < nums[j]){
-                        int temp = nums[i];
-                        nums[i] = nums[j];
-                        nums[j] = temp;
+                    if (nums1[i] < nums1[j]){
+                        int temp = nums1[i];
+                        nums1[i] = nums1[j];
+                        nums1[j] = temp;
                     }
                 }
             }
         }
-        nums1 = nums;
         String result = Arrays.stream(nums1).mapToObj(String::valueOf).collect(Collectors.joining(",", "[", "]"));
         System.out.println(result);
     }
+
+    public static int removeElement(int[] nums, int val) {
+        for (int i = 0; i < nums.length; i++) {
+            if (val == nums[i]){
+
+            }
+        }
+        return nums.length;
+    }
 }