Remove Duplicates from Sorted Array I, II

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.

Have you met this question in a real interview? 

Yes

Example

Given input array A = [1,1,2],

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

public class Solution {

    /**

     * @param A: a array of integers

     * @return : return an integer

     */

    public int removeDuplicates(int[] nums) {

        // write your code here

        if(nums == null || nums.length == 0) return 0;

        int pos = 1;

        for(int i = 1; i < nums.length; i++){

            if(nums[i] != nums[i-1]){

                nums[pos] = nums[i];

                 pos++;

            }

           

        }

        return pos;

    }

}

Remove Duplicates from Sorted Array II

Easy Remove Duplicates from Sorted Array II

29%

Accepted

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

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

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

Have you met this question in a real interview? 

Yes

Example

Tags Expand  

public class Solution {

    /**

     * @param A: a array of integers

     * @return : return an integer

     */

    public int removeDuplicates(int[] nums) {

        // write your code here

        if(nums == null || nums.length == 0) return 0;

        int pos = 1, count = 1;

        

        for(int i = 1; i < nums.length; i++){

            if(nums[pos-1] != nums[i]){

                nums[pos] = nums[i];

                count = 1;

                pos++;

            } else if(count == 1){

                count++;

                nums[pos] = nums[i];

                pos++;

            }

        }

        return pos;

    }

}