# Remove Duplicates from Sorted Array II

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array nums = `[1,1,1,2,2,3]`,

Your function should return length = `5`, with the first five elements of nums being `1``1``2``2` and `3`. It doesn't matter what you leave beyond the new length.

```public class Solution {
public int removeDuplicates(int[] nums) {
if (nums.length <= 2) {
return nums.length;
}
int pre = 1;
int cur = 2;
while (cur < nums.length) {
if (nums[cur]==nums[pre] && nums[cur]==nums[pre-1]) {
cur++;
} else {
pre++;
nums[pre] = nums[cur];
cur++;
}
}
return pre+1;
}
}```

Remove Duplicates from Sorted Array II

• 0

开心

• 0

板砖

• 0

感动

• 0

有用

• 0

疑问

• 0

难过

• 0

无聊

• 0

震惊

Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? For example,
Question: Follow up for "Remove Duplicates": What if duplicates are allowed at most twice? Fo
Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates in place such
Question: Given a sorted array, remove the duplicates in place such that each element appear

1 题目 Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only
Given a sorted linked list, delete all duplicates such that each element appear only once. Fo
Given a sorted linked list, delete all duplicates such that each element appear only once. Fo