[leetcode] 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.

思路：指针1从下标0开始，存放不同的元素；指针2遍历整个数组，寻找不同的元素，依次放在指针1的位置。

JAVA代码：

public int removeDuplicates(int[] nums) {
        if (nums.length == 0 || nums.length == 1) {
            return nums.length;
        }
        int sum = 0;
        int p = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[p] == nums[i]) {
                continue;
            }
            else {
                p++;
                sum += 1;
                int tmp = nums[i];
                nums[i] = nums[p];
                nums[p] = tmp;
            }
        }
        return sum + 1;
    }