26.删除有序数组中的重复项
题目描述

解题思路
用快慢指针
 代码
class Solution {
    public int removeDuplicates(int[] nums) {
        int arrayLength;
        int n = nums.length;
        if (n == 0) {
            return 0;
        }
        int fast = 1, slow = 1;
        while (fast < n) {
            if (nums[fast]!=nums[fast-1]){
                nums[slow++] = nums[fast];
            }
            ++fast;
        }
        return slow;
    }
}










