zoukankan      html  css  js  c++  java
  • 11 Remove Duplicates from Sorted Array II

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

    Easy难度,略

    class Solution {
    public:
        int removeDuplicates(vector<int>& nums) {
            
            int len      = nums.size();
            if(len<1) return 0;
            
            
            //initialization
            int last     = nums[0];
            int ptr  = 1; 
            
            //run
            for(int i = 0; i < len; i++)
            {
                if(nums[i] != last)
                {
                    last = nums[i]; 
                    nums[ptr] = nums[i];
                    ptr++; 
                }
            }
            
            return ptr;
        }
    };
    
  • 相关阅读:
    P1991 无线通讯网
    P1155 双栈排序
    P2024 [NOI2001]食物链
    Bellman-Ford&&SPFA算法详解
    P1387 最大正方形
    NOIP2009 靶型数独
    P3812 【模板】线性基
    Misunderstood-Missing-逆向DP
    P3389 【模板】高斯消元法
    牛客练习赛37
  • 原文地址:https://www.cnblogs.com/xiaoyisun06/p/11379267.html
Copyright © 2011-2022 走看看