LeetCode ---Remove Duplicates from Sorted Array

最新推荐文章于 2019-05-25 20:02:08 发布

原创最新推荐文章于 2019-05-25 20:02:08 发布 · 416 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一种去除有序数组中重复元素的方法，通过在原地操作数组并返回新长度来实现，避免了额外的空间使用。

Remove Duplicates from Sorted Array

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.

My Submitted Code

class Solution {
public:
    int removeDuplicates(int A[], int n) {
    int retlen=0;
    int dupcount=0;
    int i = 0,j = 1;
    int hasdup=0;
    while( j < n){
        if((A[i]==A[j])){
            hasdup=1;
            ++j;
            ++dupcount;
        }else{
            if(hasdup){
                A[i+1]=A[j];
                ++i;
                ++j;
                hasdup=0;
            }else{
                if(j-i > 1){
                    A[i+1]=A[j];
                }
                ++j;
                ++i;
            }
        }
    }
    return n-dupcount;
    }
};