506-Week 01

Week 01/id_506/LeetCode_ 26_506.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int removeDuplicates(int[] nums) {
+
+        int p1 = 0;
+        int p2 = 1;
+
+        while(p2 < nums.length){
+
+            if (nums[p1] != nums[p2]){
+
+                p1++;
+                nums[p1] = nums[p2];
+
+            }
+            p2++;
+
+        }
+        return ++p1;
+
+    }
+
+
+}

Week 01/id_506/LeetCode_21_506.java

@@ -0,0 +1,40 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
+
+        ListNode head = new ListNode(-1);
+
+        ListNode prev = head;
+
+
+        while (l1 != null && l2 != null) {
+            if (l1.val > l2.val) {
+                prev.next = l2;
+                l2 = l2.next;
+
+
+            }else {
+                prev.next = l1;
+                l1 = l1.next;
+            }
+            prev = prev.next;
+        }
+
+        if (l2 != null){
+            prev.next = l2;
+        }
+
+        if (l1 != null){
+            prev.next = l1;
+        }
+
+        return head.next;
+    }
+}

Week 01/id_506/LeetCode_66_506.java

@@ -0,0 +1,49 @@
+class Solution {
+    public int[] plusOne(int[] digits) {
+        int index = -1;
+
+        for (int i = digits.length -1 ;i > -1; i--){
+
+            if (digits[i] != 9){
+                index = i;
+                break;
+            }
+
+        }
+
+        if (index == -1){
+            int[] result = new int[digits.length + 1];
+            result[0] = 1;
+            for (int i = 1; i < digits.length + 1; i++){
+                result[i] = 0;
+            }
+            return result;
+
+        }
+
+        digits[index]++;
+        for (int i = index+1; i < digits.length; i++){
+            digits[i] = 0;
+        }
+
+        return digits;
+    }
+
+
+    public int[] plusOne1(int[] digits) {
+        for (int i = digits.length - 1; i >=0; i--) {
+            if (digits[i] != 9) {
+                digits[i]++;
+                break;
+            } else {
+                digits[i] = 0;
+            }
+        }
+        if (digits[0] == 0) {
+            int[] res = new int[digits.length+1];
+            res[0] = 1;
+            return res;
+        }
+        return digits;
+    }
+}

Week 01/id_506/LeetCode_88_506.java

@@ -0,0 +1,23 @@
+class Solution {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int i = m + n -1;
+
+        int a = m -1;
+        int b = n -1;
+
+        while(a >= 0 && b >= 0){
+
+
+            if (nums1[a] <= nums2[b]){
+                nums1[i] = nums2[b];
+                b--;
+
+            }else{
+                nums1[i] = nums1[a];
+                a--;
+            }
+            i --;
+        }
+        System.arraycopy(nums2, 0, nums1, 0, b + 1);
+    }
+}