"Description: Given a sorted array nums , remove the duplicates [链接] such that each element appear only_once_and return the new length. Do not allocate extra spa .."

[每日 LeetCode] 26. Remove Duplicates from Sorted Array

Description:

Given a sorted array nums , remove the duplicates in-place such that each element appear only_once_and return the new length.

Do not allocate extra space for another array, you must do this by modifying the input array [in-place] (https://en.wikipedia.org/wiki/In-place_algorithm) with O(1) extra memory.

Example 1:

Given nums = [1,1,2],

Your function should return length =  2, with the first two elements of nums being 1 and 2 respectively.

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

Example 2:

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

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

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

思路:本题要求去除已排序数组中重复的元素,并返回数组大小。考虑从前往后找,找到一个和前一个数字不同的就放到前面,相同的话不予处理。


C++ 代码

class Solution {
public:
     int removeDuplicates(vector<int>& nums) {
        if(nums.size()==0) return 0;
        int len = 1;
        for(int i=1;i<nums.size();i++){
            
            if(nums[i]!=nums[i-1]){
                nums[len++] = nums[i];
            }
        }
        return len;
    }
};

运行时间:32ms 运行内存:10.7M

  • LeetCode

    LeetCode(力扣)是一个全球极客挚爱的高质量技术成长平台,想要学习和提升专业能力从这里开始,充足技术干货等你来啃,轻松拿下 Dream Offer!

    122 引用 • 34 回帖
  • array
    45 引用 • 2 回帖
  • Easy
    74 引用 • 10 回帖
感谢    关注    收藏    赞同    反对    举报    分享
回帖    
请输入回帖内容...