[Leetcode] Remove Duplicates in Sorted Array

最新推荐文章于 2022-04-06 16:22:53 发布

原创最新推荐文章于 2022-04-06 16:22:53 发布 · 198 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

67 篇文章

订阅专栏

本文介绍了一个算法，用于在不使用额外空间的情况下，去除数组中的重复元素，并返回处理后的数组长度。

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 A = [1,1,2],

Your function should return length = 2, and A is now [1,2].

class Solution {
public:
    int removeDuplicates(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int length = 0;
        if(n==0) return 0;
        int current = A[0]+1;
        
        for(int i=0;i<n;i++)
        {
            if(current!=A[i])
            {
                A[length] = A[i];
                length++;
                current = A[i];
            }
        }
        
        return length;
    }
};