思路:运用双指针的快慢指针技巧 Leetcode 26. 删除有序数组中的重复项 class Solution { public int removeDuplicates(int[] nums) { if (nums.length == 0) { return 0; } int slow = 0, fast = 0; while (fast < nums.length) { if (nums[fast] != nums[slow]) { slow++; // 维护 nums[0..slow] 无重复 nums[