76 leetcode - Remove Duplicates from Sorted Array II

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
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.
'''
class Solution(object):
    def removeDuplicates(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        length = len(nums)
        if length <= 2:
            return length

        flag = False
        ret = 1
        cur = 1
        for index in range(1,length):
            if nums[index] == nums[index - 1]:
                if flag == False:
                    ret += 1    
                    flag = True
                    nums[cur] = nums[index]
                    cur += 1
            else:
                flag = False
                ret += 1
                nums[cur] = nums[index]
                cur += 1
        #print nums[:cur]
        return ret

if __name__ == "__main__":
    s = Solution()
    print s.removeDuplicates([1,1,1,2,2,3])
    print s.removeDuplicates([1,1,1,1,1,1,2,2,2,3])
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值