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

思路：同上一篇文章一样，还是采用双指针法，只是在这一道题中改为比较两个相邻元素的值

public class Solution {       public static int removeDuplicates(int[] nums) {    if (nums == null || nums.length == 0)        return 0;    int slow = 0, fast = 1, len = nums.length;    while (fast < len) {        if (nums[fast] != nums[fast - 1]) {            nums[++slow] = nums[fast];        }        fast++;    }    return slow + 1;    }}