一、题目描述
二、代码实现
package com.it.leetcode;
public class Day_0001 {
public static void main(String[] args) {
int[] nums = {1,1,2};
System.out.println(removeDuplicates(nums));
}
//快慢指针解法
private static int removeDuplicates(int[] nums) {
if (nums.length == 0) {
return 0;
}
int last = 0;//慢指针
int fast = 1;//快指针
while (fast < nums.length) {
if (nums[last] != nums[fast]) {
nums[last + 1] = nums[fast];
last++;
}
fast++;
}
return last + 1;
}
}