Day60

swolecoder · swolecoder · commit 8c46d9c7c997 · 2020-12-11T04:03:34.000-05:00
diff --git a/Day60/index.js b/Day60/index.js
@@ -0,0 +1,18 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function (nums) {
+
+    for (let i = 0; i < nums.length; i++) {
+
+        if (nums[i] == nums[i + 1]) {
+
+            i++;
+
+            while (nums[i] == nums[i + 1]) {
+                nums.splice(i + 1, 1)
+            }
+        }
+    }
+};
diff --git a/README.md b/README.md
@@ -135,4 +135,6 @@ If you are loving solving problems in leetcode, please contact me to enjoy it to
 
 |Day 58| [117. Populating Next Right Pointers in Each Node II](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/)|Medium|
 
-|Day 59| [1. Two Sum](https://leetcode.com/problems/two-sum/) | [javascript]()|[:memo:](https://leetcode.com/problems/two-sum/)|Easy|
+|Day 59| [1. Two Sum](https://leetcode.com/problems/two-sum/) | [javascript]()|[:memo:](https://leetcode.com/problems/two-sum/)|Easy|
+
+|Day 60| [80. Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/) | [javascript]()|[:memo:](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)|Medium|
