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.

由于可重复元素不能超过2个，需要维护一个count，超过两个时直接跳过

class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if nums == None or len(nums) == 0:
        	return 0
        idx = 0
        count = 0
        for i in xrange(0, len(nums)):
        	if i > 0 and nums[i]==nums[i-1]:
        		count += 1
        		if count >= 3:
        			continue
        	else:
        		count = 1
        	nums[idx] = nums[i]
        	idx += 1
        return idx