LeetCode[80] 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.

Subscribe to see which companies asked this question

代码:

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;
}
}

欢迎关注公众号: FullStackPlan 获取更多干货

Copyright © 2016 - 2017 LBD All Rights Reserved.

访客数 : | 访问量 :