solves remove duplicates fromsorted array ii

Author: anishLearnsToCode

README.md

@@ -73,6 +73,7 @@
 |  77  | [Combinations](https://leetcode.com/problems/combinations)                                                                                                |                                                                  [![Java](assets/java.png)](src/Combinations.java)                                                                   |                                                                                                                                   |
 |  78  | [Subsets](https://leetcode.com/problems/subsets)                                                                                                          |                                                                     [![Java](assets/java.png)](src/Subsets.java)                                                                     |                                                                                                                                   |
 |  79  | [Word Search](https://leetcode.com/problems/word-search)                                                                                                  |                                                                   [![Java](assets/java.png)](src/WordSearch.java)                                                                    |                                                                                                                                   |
+|  80  | [Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)                                            |                                                        [![Java](assets/java.png)](src/RemoveDuplicatesFromSortedArrayII.java)                                                        |                                                                                                                                   |
 |  83  | [Remove Duplicates from Sorted List](https://leetcode.com/problems/remove-duplicates-from-sorted-list)                                                    |                   [![Java](assets/java.png)](src/RemoveDuplicatesFromSortedList.java) [![Python](assets/python.png)](python/remove_duplicates_from_linked_list.py)                   |                                                                                                                                   |
 |  88  | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)                                                                                    |                                  [![Java](assets/java.png)](src/MergeSortedArray.java) [![Python](assets/python.png)](python/merge_sorted_array.py)                                  |                                                                                                                                   |
 |  94  | [Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)                                                             |                       [![Java](assets/java.png)](src/BinaryTreeInorderTraversal.java) [![Python](assets/python.png)](python/binary_tree_inorder_traversal.py)                        |                                                                                                                                   |

src/RemoveDuplicatesFromSortedArrayII.java

@@ -0,0 +1,20 @@
+// https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii
+// T: O(N)
+// S: O(1)
+
+public class RemoveDuplicatesFromSortedArrayII {
+    public int removeDuplicates(int[] nums) {
+        int insertionIndex = 1;
+        for (int i = 1, count = 1 ; i < nums.length ; i++) {
+            if (nums[i] == nums[insertionIndex - 1]) {
+                if (count == 2) continue;
+                nums[insertionIndex++] = nums[i];
+                count++;
+            } else {
+                nums[insertionIndex++] = nums[i];
+                count = 1;
+            }
+        }
+        return insertionIndex;
+    }
+}