algorithm004-01 · melody-li · Oct 20, 2019 · Oct 13, 2019 · Oct 13, 2019 · Oct 20, 2019
diff --git a/Week 01/id_386/LeetCode_1_386.java b/Week 01/id_386/LeetCode_1_386.java
@@ -0,0 +1,21 @@
+class SumOfTwoNumbers {
+    public int[] twoSum(int[] nums, int target) {
+        int[] n = new int[2];
+        for (int i = 0; i < nums.length; i++) {
+            for (int j = 0; j < nums.length; j++) {
+                if (i != j && (nums[i] + nums[j] == target)) {
+                    // System.out.println(i + ", " + j);
+                    if (i < j) {
+                        n[0] = i;
+                        n[1] = j;   
+                    } else {
+                        n[0] = j;
+                        n[1] = i;
+                    }
+                    return n;
+                }
+            }
+        }
+        return new int[0];
+    }
+}
diff --git a/Week 01/id_386/LeetCode_26_386.java b/Week 01/id_386/LeetCode_26_386.java
@@ -0,0 +1,29 @@
+class RemoveDuplicates {
+    public int removeDuplicates(int[] nums) {
+        int count = 0;
+
+        if(nums.length > 0) { 
+            int[] arr = new int[nums.length];
+            arr[0] = nums[0];
+            //System.out.println("arr[0], " + arr[0]);
+            for(int i = 0; i < nums.length; i++) {
+                for(int j = i; j < nums.length; j++) {
+                    if(i != j && nums[i] != nums[j]) {
+                        arr[++count] = nums[j];
+                        nums[count] = arr[count];
+                        break;
+                    } else {
+                        i = j;
+                    }
+                }
+            }
+        } else {
+            return 0;
+        }
+
+        int[] a = new int[count+1];
+        nums = a;
+
+        return nums.length;
+    }
+}
diff --git a/Week 01/id_386/LeetCode_88_386.java b/Week 01/id_386/LeetCode_88_386.java
@@ -0,0 +1,27 @@
+class Merge {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        for (int i = nums1.length - 1; i >= 0; i--) {
+            // System.out.print(nums1[i]);
+            if (n > 0) {
+                // System.out.print(nums2[n-1]);
+                nums1[i] = nums2[n-1];
+                n--;
+            }
+        }
+
+        int a, b = 0;
+
+        for (int i = 0; i < nums1.length; i++) {
+            for (int j = 0; j < nums1.length - 1; j++) {
+                if (j <= nums1.length - 1 && nums1[j+1] < nums1[j]) {
+                    a = nums1[j+1];
+                    b = nums1[j];
+                    nums1[j] = a;
+                    nums1[j+1] = b;
+
+                } 
+            }
+        }
+
+    }
+}
diff --git a/Week 预习周/id_386/数据结构.png b/Week 预习周/id_386/数据结构.png
diff --git a/Week 预习周/id_386/算法.png b/Week 预习周/id_386/算法.png