一、题目
Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.
Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.
Return k after placing the final result in the first k slots of nums.
Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.
Custom Judge:
The judge will test your solution with the following code:
int[] nums = [...]; // Input array
int[] expectedNums = [...]; // The expected answer with correct length
int k = removeDuplicates(nums); // Calls your implementation
assert k == expectedNums.length;
for (int i = 0; i < k; i++) {
assert nums[i] == expectedNums[i];
}
If all assertions pass, then your solution will be accepted.
Example 1:
Input: nums = [1,1,2]
Output: 2, nums = [1,2,_]
Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).
Example 2:
Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]
Explanation: Your function should return k = 5, with the first five elements of nums being 0, 1, 2, 3, and 4 respectively.
It does not matter what you leave beyond the returned k (hence they are underscores).
Constraints:
1 <= nums.length <= 3 * 104
-100 <= nums[i] <= 100
nums is sorted in non-decreasing order.
二、 思路
通过一个快指针(fast)和一个慢指针(slow)在一个for循环下完成两个for循环的工作。
二、自己写的
1.代码
第一次写
class Solution {
public int removeDuplicates(int[] nums) {
//slow存有效的,fast来遍历
//slow里面存不重复的
int slow = 0, fast = 0;
while (fast < nums.length) {
//如果不一样的话就放进slow里面
if (nums[fast] != nums[slow]) {
//slow=fast=0的时候,一定相等,所以跳过,nums[0]就存下了,所以等下一个不相等的时候,slow先++再存
slow++;
nums[slow] = nums[fast];
}
fast++;
}
//返回个数,就是返回nums最后的长度,slow+1
return slow + 1;
}
}
//正确,按上一个题一样思考就ok
三、标准答案
1.方法一(快慢指针)
class Solution {
public int removeDuplicates(int[] nums) {
//slow存有效的,fast来遍历
//slow里面存不重复的
int slow = 0, fast = 0;
while (fast < nums.length) {
//如果不一样的话就放进slow里面
if (nums[fast] != nums[slow]) {
//slow=fast=0的时候,一定相等,所以跳过,nums[0]就存下了,所以等下一个不相等的时候,slow先++再存
slow++;
nums[slow] = nums[fast];
}
fast++;
}
//返回个数,就是返回nums最后的长度,slow+1
return slow + 1;
}
}
2.总结
和上一个题一模一样的考虑就ok了