zoukankan      html  css  js  c++  java
  • [LeetCode] 26

    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.

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

  • 相关阅读:
    linux 第五天
    linux 第四天
    二进制 位运算
    二进制
    java 方法的调用过程
    Linux 第三天
    Linux 第二天
    Linux
    学习了半个多月的TankGame
    学习第一天(spring)
  • 原文地址:https://www.cnblogs.com/shoemaker/p/4765823.html
Copyright © 2011-2022 走看看