Remove Duplicates from Sorted Array I, II

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.

Solution

Two pointer : cur, prev

cur points to the current element of the array while prev points to the current index of the array.

public class Solution {
    public int removeDuplicates(int[] nums) {
        if (nums == null || nums.length == 0)
            return 0;
        
        if (nums.length <= 2)
            return nums.length;
        
        int prev = 1;
        int cur = 2;
        
        while (cur < nums.length) {
            if (nums[cur] == nums[prev] && nums[cur] == nums[prev - 1])
                cur++;
            
            else {
                prev++;
                nums[prev] = nums[cur];
                cur++;
            }
        }
        
        return prev + 1;
    }
}

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.

j: points to current index of the array

i: traverse the whole array

public class Solution {
    public int removeDuplicates(int[] nums) {
        if (nums == null || nums.length == 0)
            return 0;
            
        int j = 1;
        for (int i = 1; i < nums.length; i++) {
            if (nums[i] != nums[i - 1])
                nums[j++] = nums[i];
        }
        
        return j;
    }
}