26. Remove Duplicates from Sorted Array

发表于 | 分类于 ， | 阅读次数:

Total Accepted: 112046
Total Submissions: 342076
Difficulty: Easy

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 1 respectively. It doesn’t matter what you leave beyond the new length.

Java:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
public class Solution {
    public int removeDuplicates(int[] nums) {
        int dupes = 0;
        int len=nums.length;

        for (int i = 1; i < len; i++)
        {
            if (nums[i] == nums[i - 1])
                dupes++;
            nums[i - dupes] = nums[i];
        }

        return len - dupes;
    }
}

打个小广告

欢迎加入我的小专栏「基你太美」一起学习。