zoukankan      html  css  js  c++  java
  • 39-Remove Duplicates from Sorted Array

    1. Remove Duplicates from Sorted Array My Submissions QuestionEditorial Solution
      Total Accepted: 127836 Total Submissions: 381794 Difficulty: Easy
      Given a sorted array, 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 in place with constant memory.

    For example,
    Given input array 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 new length.

    Submission Details
    161 / 161 test cases passed.
    Status: Accepted
    Runtime: 32 ms

    思路:so easy

    class Solution {
    public:
        int removeDuplicates(vector<int>& nums) {
            size_t n = nums.size();
            int count=0,i=0;
            while(i<n){
                if(i>0&&nums[i]==nums[i-1])count++;
                else nums[i-count] = nums[i];
                i++;
            }
            return n-count;
        }
    };
  • 相关阅读:
    Linux内核info leak漏洞
    ELK Stack部署
    centos下安装opencv
    windows10 进入BIOS
    Dockerfile语法简介
    JAVA 容器配置 JVM 监控
    docker registry
    squid
    正反向代理
    安装plsql
  • 原文地址:https://www.cnblogs.com/freeopen/p/5482929.html
Copyright © 2011-2022 走看看