当前位置:首页 > 开发 > 编程语言 > 编程 > 正文

Remove Duplicates from Sorted Array II

发表于: 2015-07-03   作者:hcx2013   来源:转载   浏览:
摘要: 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

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 1122 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

    震惊

    震惊

版权所有 IT知识库 CopyRight © 2009-2015 IT知识库 IT610.com , All Rights Reserved. 京ICP备09083238号