leetcode

Random Problem

2 files changed, 16 insertions(+), 0 deletions(-)

diff --git a/ Problems/0080.cpp b/ Problems/0080.cpp

@@ -0,0 +1,15 @@

class Solution {

public:

int removeDuplicates(vector<int> &nums) {

int k = 1;

for (int i = 1; i < nums.size(); i++) {

nums[k++] = nums[i];

if (nums[i] == nums[i - 1]) {

while (++i < nums.size() && nums[i] == nums[k - 2])

;

i--;

}

}

return k;

}

};

diff --git a/ README.md b/ README.md

@@ -97,6 +97,7 @@ for solving problems. | 0077 | Medium | [Combinations](Problems/0077.cpp) | | 0078 | Medium | [Subsets](Problems/0078.cpp) | | 0079 | Medium | [Word Search](Problems/0079.cpp) |

| 0080 | Medium | [Remove Duplicates from Sorted Array II](Problems/0080.cpp) |

| 0082 | Medium | [Remove Duplicates from Sorted List II](Problems/0082.cpp) | | 0083 | Easy | [Remove Duplicates from Sorted List](Problems/0083.cpp) | | 0084 | Hard | [Largest Rectangle in Histogram](Problems/0084.cpp) |