leetcode-26-Remove Duplicates from Sorted Array

最新推荐文章于 2020-11-28 21:12:49 发布

别哔哔好伐

最新推荐文章于 2020-11-28 21:12:49 发布

阅读量298

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode 指针

本文链接：https://blog.csdn.net/u014705854/article/details/50781064

LeetCode 专栏收录该内容

64 篇文章

订阅专栏

本文介绍了一种在原地且使用常数空间复杂度的方法来去除已排序数组中的重复元素，并给出了C++及Java两种语言的实现示例。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Subscribe to see which companies asked this question

移除数组中重复的数，要求在原数组上操作，常数的空间。

用两个指针，后一个指针指向的数与前一项比较，如果相等，则指针后移，如果不相等，则将这个数赋值给前一个指针所指的位置。

c++

class Solution {
public:
    int removeDuplicates(vector<int>& nums) {
        int  num = 0 , front = 1 , last = 1 , size = nums.size() ;
        if (size == 0 ) return 0 ;
        if ( size == 1 ) return 1 ;
        while ( last < size) {
            if ( nums[last] != nums[last - 1] ) {
                nums[front] = nums[last] ;
                front ++ ;
            }
            last ++ ;
        }
        return front ;
    }
};

java

public class Solution {
    public int removeDuplicates(int[] nums) {
        int  num = 0 , front = 1 , last = 1 , size = nums.length ;
        if (size == 0 ) return 0 ;
        if ( size == 1 ) return 1 ;
        while ( last < size) {
            if ( nums[last] != nums[last - 1] ) {
                nums[front] = nums[last] ;
                front ++ ;
            }
            last ++ ;
        }
        return front ;
    }
}