【LeetCode】80.Remove Duplicates from Sorted Array II(Medium)解题报告

【LeetCode】80.Remove Duplicates from Sorted Array II(Medium)解题报告

题目地址：https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/description/
题目描述：

  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.

Solution:

/*
1 1 1 2 2 3
1 1 2 2 3
        c
           i
time : O(n)
space : O(1)
*/

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

Date：2018年3月5日