Leetcode 26. Remove Duplicates from Sorted Array

版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://blog.csdn.net/Quincuntial/article/details/81948923

文章作者:Tyan 博客:noahsnail.com | CSDN | 简书

1. Description

2. Solution

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

Reference

  1. https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

扫码关注云+社区

领取腾讯云代金券