leetcode-26. 删除有序数组中的重复项

class Solution {
    public int removeDuplicates(int[] nums) {
        // 使用双指针
        if (nums == null || nums.length == 0) {
             return 0; 
            } 
        int i = 0, j = 0;
        while (j < nums.length) {
            if (nums[i] != nums[j]) { 
                nums[++i] = nums[j]; 
            } 
            j++; 
        } 
        return ++i; 
    }
}