LeetCode、80. Remove Duplicates from Sorted Array II

189 篇文章 0 订阅
162 篇文章 0 订阅

Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

Example 1:

Given 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 respectively.

It doesn't matter what you leave beyond the returned length.

 

Example 2:

Given nums = [0,0,1,1,1,1,2,3,3],

Your function should return length = 7, with the first seven elements of nums being modified to 0, 0, 1, 1, 2, 3 and 3 respectively.

It doesn't matter what values are set beyond the returned length.

 

 

 

 

代码:

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

 

 

方法二、

避免不必要的赋值

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

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值