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

    public int removeDuplicates(int[] nums) {
        int  n = nums.length;
        if (n == 0) {
            return 0;
        }
        int fast = 1;
        int slow = 1;
        while (fast<n) {
            if(nums[fast-1] != nums[fast]) {
                nums[slow] = nums[fast];
                slow++;
            }
            fast++;
        }
        return slow;
    }