[LeetCode]26. Remove Duplicates from Sorted Array 解题报告(C++)

[LeetCode]26. Remove Duplicates from Sorted Array 解题报告(C++)

题目描述

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.

题目大意

  • 给定一个以及排序的数组
  • 去除排序数组中的重复元素.
  • 使得每个字符出现一次.返回新的长度

解题思路

方法1:

  • 暴力方法:需要额外空间
  • 利用 set 的有序以及唯一性质.
代码实现:
int removeDuplicates1(vector<int>& nums) {
    set<int> myset(nums.begin(), nums.end());
    nums.clear();
    auto it = myset.begin();
    while (it != myset.end()) {
        nums.push_back(*it);
        it++;
    }
    return myset.size();
}

方法2:

  • 快慢指针
  • 若数字相同,快指针++
  • 若数字不同,则将快指针指向的值付给慢指针i+1. 并且i++,j++
代码实现:
int removeDuplicates(vector<int>& nums) {
    int size = nums.size();
    if (size <= 1) {
        return size;
    }
    int i, j;
    for (i = 0, j = 0; j < size;) {
        if (nums[i] == nums[j]) {
            j++;
        }
        else {
            nums[i+1] = nums[j];
            i++;
            j++;
        }
    }
    return i+1;
}

// 简化写法:
class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
    int size = nums.size();
    if (size < 1) {
        return size;
    }
    int i, j;
    for (i = 0, j = 0; j < size;j++) {
        if(nums[i]!=nums[j]){
            nums[++i] = nums[j];
        }
    }
    return i+1;
    }/
};

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值