# Remove Duplicates from Sorted Array II

94人阅读 评论(0)

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.

#### C++

class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if(nums.size() <= 2)
return nums.size();

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

#### Java

public class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length <= 2)
return nums.length;
int index = 2;
for(int i = 2; i < nums.length; i++)
{
if(nums[i] != nums[index - 2])
nums[index++] = nums[i];
}
return index;
}
}

#### Python

class Solution(object):
def removeDuplicates(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
if len(nums) <= 2:
return len(nums)

index = 2
for i in range(2,len(nums)):
if nums[i] != nums[index -2]:
nums[index] = nums[i]
index += 1

return index
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：57262次
• 积分：1722
• 等级：
• 排名：千里之外
• 原创：119篇
• 转载：6篇
• 译文：0篇
• 评论：3条
评论排行
最新评论