[LeetCode]Remove Duplicates from Sorted Array II

原创于 2015-09-28 17:36:21 发布 · 328 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

38 篇文章

订阅专栏

探讨了如何在已排序的数组中移除多余的重复元素，使得每个元素最多出现两次，并返回新的有效长度。示例中，对于输入数组[1,1,1,2,2,3]，经过处理后的数组前五位为[1,1,2,2,3]，并返回长度5。

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.

题解：不能超过2个重复的数，用一个标记来标识。

code：

public class Solution {
    public int removeDuplicates(int[] nums) {
      if( nums == null || nums.length == 0)
			return 0;
		int index=0, flag=0;
		
		for(int i=1; i<nums.length; i++){
			if(nums[i] == nums[i-1] && flag ==0){
				index++;
				flag = 1;
			}else if(nums[i] != nums[i-1]){
				index++;
				flag = 0;
			}
			nums[index] = nums[i]; 
		}
		return index+1;
    }
}