## Algorithm

Problem Name: 80. Remove Duplicates from Sorted Array II

Given an integer array `nums` sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array `nums`. More formally, if there are `k` elements after removing the duplicates, then the first `k` elements of `nums` should hold the final result. It does not matter what you leave beyond the first `k` elements.

Return `k` after placing the final result in the first `k` slots of `nums`.

Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

Custom Judge:

The judge will test your solution with the following code:

```int[] nums = [...]; // Input array
int[] expectedNums = [...]; // The expected answer with correct length

int k = removeDuplicates(nums); // Calls your implementation

assert k == expectedNums.length;
for (int i = 0; i < k; i++) {
assert nums[i] == expectedNums[i];
}
```

If all assertions pass, then your solution will be accepted.

Example 1:

```Input: nums = [1,1,1,2,2,3]
Output: 5, nums = [1,1,2,2,3,_]
Explanation: Your function should return k = 5, with the first five elements of nums being 1, 1, 2, 2 and 3 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).
```

Example 2:

```Input: nums = [0,0,1,1,1,1,2,3,3]
Output: 7, nums = [0,0,1,1,2,3,3,_,_]
Explanation: Your function should return k = 7, with the first seven elements of nums being 0, 0, 1, 1, 2, 3 and 3 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).
```

Constraints:

• `1 <= nums.length <= 3 * 104`
• `-104 <= nums[i] <= 104`
• `nums` is sorted in non-decreasing order.

## Code Examples

### #1 Code Example with C Programming

```Code - C Programming```

``````
int removeDuplicates(int* nums, int numsSize) {
int i, j;

if (numsSize  <  3) return numsSize;

for (i = 2, j = 2; j  <  numsSize; j ++) {
if (nums[j] != nums[i - 2]) {
nums[i] = nums[j];
i ++;
}
}

return i;
}
``````
Copy The Code &

Input

cmd
nums = [1,1,1,2,2,3]

Output

cmd
5, nums = [1,1,2,2,3,_]

### #2 Code Example with C++ Programming

```Code - C++ Programming```

``````
class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() < 3) return nums.size();
int i = 2, j = 2;
while(j  <  nums.size()>
if(nums[j] > nums[i - 2]) nums[i++] = nums[j++];
else j++;
return i;
}
};
``````
Copy The Code &

Input

cmd
nums = [1,1,1,2,2,3]

Output

cmd
5, nums = [1,1,2,2,3,_]

### #3 Code Example with Java Programming

```Code - Java Programming```

``````
class Solution {
public int removeDuplicates(int[] nums) {
int startIdx = 0;
int n = nums.length;
int currIdx = 0;
while (currIdx  <  n) {
int currValue = nums[currIdx];
int count = 0;
while (currIdx  <  n && nums[currIdx] == currValue) {
currIdx++;
count++;
}
for (int i = 0; i  <  Math.min(2, count); i++) {
nums[startIdx++] = currValue;
}
}
return startIdx;
}
}
``````
Copy The Code &

Input

cmd
nums = [0,0,1,1,1,1,2,3,3]

Output

cmd
7, nums = [0,0,1,1,2,3,3,_,_]

### #4 Code Example with Javascript Programming

```Code - Javascript Programming```

``````
const removeDuplicates = function(nums) {
for(let i = 0; i  <  nums.length;) {
if(i >= 0 && i - 1 >= 0 && i- 2 >= 0 && nums[i] === nums[i - 1] && nums[i] === nums[i - 2]) {
nums.splice(i, 1)
} else {
i++
}
}
};
``````
Copy The Code &

Input

cmd
nums = [0,0,1,1,1,1,2,3,3]

Output

cmd
7, nums = [0,0,1,1,2,3,3,_,_]

### #5 Code Example with Python Programming

```Code - Python Programming```

``````
class Solution:
def removeDuplicates(self, nums: List[int]) -> int:
i = 2
for j in range(2, len(nums)):
if nums[i - 2] != nums[j]:
nums[i] = nums[j]
i += 1
return min(i, len(nums))
``````
Copy The Code &

Input

cmd
nums = [1,1,1,2,2,3]

Output

cmd
5, nums = [1,1,2,2,3,_]

### #6 Code Example with C# Programming

```Code - C# Programming```

``````
namespace LeetCode
{
public class _080_RemoveDuplicatesFromSortedArray2
{
public int RemoveDuplicates(int[] nums)
{
if (nums.Length <= 2) { return nums.Length; }

var index = 2;
var lastValue = nums[0];

for (int i = 2; i  <  nums.Length; i++)
if (nums[i] != nums[index - 2])
{
nums[index++] = nums[i];
lastValue = nums[index - 2];
}

return index;
}
}
}
``````
Copy The Code &

Input

cmd
nums = [1,1,1,2,2,3]

Output

cmd
5, nums = [1,1,2,2,3,_]