个人记录-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.

问题要求：
得到排序数组中，非重复数据的长度n；
同时，将非重复数据移动到前n个位置。

这个问题比较简单，没什么好多说的。

代码示例：

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