two-pointers-2

MergeSorted.java

@@ -0,0 +1,20 @@
+public class MergeSorted {
+    public void merge(int[] nums1, int m, int[] nums2, int n) {
+        int left = m-1;
+        int right = m+n-1;
+        int i = n-1;
+        while (i>=0 && left>=0) {
+            if (nums1[left] < nums2[i]) {
+                nums1[right] = nums2[i];
+                right--; i--;
+            } else {
+                nums1[right] = nums1[left];
+                right--; left--;
+            } 
+        }
+        while (i>=0) {
+            nums1[right] = nums2[i];
+            right--; i--;
+        }
+    }
+}

RemoveDup.java

@@ -0,0 +1,17 @@
+
+public class RemoveDup {
+    public int removeDup(int[] nums) {
+        int slow =1;
+        int count =1;
+        for (int fast=1; fast<nums.length; fast++){
+            if (nums[fast] == nums[fast-1]){
+                count++;
+            }else{ count=1;}
+            if (count <=2){
+                nums[slow] = nums[fast];
+                slow++;
+            }
+        }
+        return slow;
+    }
+}

Search2D.java

@@ -0,0 +1,19 @@
+public class Search2D {
+    public boolean searchMatrix(int[][] m, int target) {
+        int rows = matrix.length;
+        int cols = matrix[0].length;
+        int row = 0;
+        int col = cols-1;
+        while ((row>=0 && row<rows) && (col>=0 && col<cols)) {
+            if (target == matrix[row][col]) {
+                return true;
+            } else if (matrix[row][col] < target) {
+                row++;
+            } else {
+                col--;
+            }
+        }
+        return false;
+    }
+}
+