Leetcode_remove-duplicates-from-sorted-array-ii (c++ and python version)

62 篇文章 0 订阅
52 篇文章 0 订阅

地址:http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array-ii/


Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array A = [1,1,1,2,2,3],

Your function should return length = 5, and A is now [1,1,2,2,3].

思路:笔者用的map来标记的。应该可以不用map直接用几个下标来标记,这样的话额外空间就小了。因为题目说好了数组是排好序的,用map的话就没用利用这一点。

参考代码:

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        map<int, int>dm;
        for(int i = 0; i < n; ++i)
        {
            if(dm[A[i]]==0)
            {
                dm[A[i]] = 1;
            }
            else if(dm[A[i]]==1)
            {
                dm[A[i]] = 2;
            }
            else
            {
                for(int j = i; j < n-1; ++j)
                {
                    A[j] = A[j+1];
                }
                --i;
                --n;
            }
        }
        return n;
    }
};


 
 
//SECOND TRIAL, in place
class Solution {
public :
     int removeDuplicates ( int A [], int n ) {
         if ( n <= 2 )
             return n ;
         int len = 1 ;
         bool flag = true ;
         for ( int i = 1 ; i < n ; ++ i )
         {
             if ( A [ i ] != A [ len - 1 ])
             {
                 A [ len ++ ] = A [ i ];
                 flag = true ;
             }
             else if ( flag )
             {
                 A [ len ++ ] = A [ i ];
                 flag = false ;
             }
         }
         return len ;
     }
};

python:

 
 
class Solution :
     # @param A a list of integers
     # @return an integer
     def removeDuplicates ( self , A ):
         if len ( A ) <= 2 :
             return len ( A )
         cnt = 1
         flag = True
         for i in range ( 1 , len ( A )):
             if A [ i ] != A [ i - 1 ]:
                 flag = True
                 A [ cnt ] = A [ i ]
                 cnt += 1
             elif flag :
                 flag = False
                 A [ cnt ] = A [ i ]
                 cnt += 1
         return cnt

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值