26. Remove Duplicates from Sorted Array && 80. Remove Duplicates from Sorted Array II

26. 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.

Hide Tags

Array Two Pointers

Hide Similar Problems

(E) Remove Element

public class Solution {
    public int removeDuplicates(int[] A) {
        if(A.length == 0) return 0;

        int unique = 1;
        for(int i = 1; i<A.length; ++i) {
            if(A[i]!=A[i-1])
                A[unique++] = A[i];
        }
        return unique;
    }
}

80. Remove Duplicates from Sorted Array II

Follow up for "Remove Duplicates":
What if duplicates are allowed at most twice?

For example,
Given sorted array nums = [1,1,1,2,2,3],

Your function should return length = 5, with the first five elements of nums being 1, 1, 2, 2 and 3. It doesn‘t matter what you leave beyond the new length.

Hide Tags

Array Two Pointers

public class Solution {
    public int removeDuplicates(int[] nums) {
        if(nums.length == 0) return 0;

        int count = 1;
        int unique = 1;
        for(int i = 1; i<nums.length; ++i) {
            if(nums[i]!=nums[i-1]) {
                nums[unique++] = nums[i];
                count = 1;
            }
            else if(count<2) {
                nums[unique++] = nums[i];
                ++count;
            }
        }
        return unique;
    }
}