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个数字即可）
代码如下

        if(nums.length <= 1){
            return nums.length;
        }
        int res = 1;
        for(int i=1;i<nums.length;i++){
            if(nums[i] != nums[i-1]){
                 nums[res++] = nums[i];
            }
        }
        return res;