26. Remove Duplicates from Sorted Array
描述:
Given a sorted array, remove the duplicates in-place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
Example:
Given nums = [1,1,2], Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively. It doesn't matter what you leave beyond the new length.
我的思路:
题目要求删除已经排好序的数组中的重复的元素,因此可以利用“已经排好序”这一特点解决问题。设置两个“指针”i和j,初始时i指向数组的第一个元素,j指向数组的第二个元素,其中i以较慢的速度扫描数组,j以较快的速度扫描数组。如果nums[i]==nums[j],则j继续向前扫描数组,i指向不变化;如果nums[i] != nums[j],则重复的元素结束了,将nums[j]赋值给nums[i+1]。重复该过程直至数组完全扫描结束。
我的解决:
class Solution {
public int removeDuplicates(int[] nums) {
if(nums.length==0) { //判断是否为空数组
return 0;
}
int i=0;
for (int j =1; j<nums.length;j++){
if(nums[i]!=nums[j]){
i++;
nums[i]=nums[j];
}
}
return i+1;
}
}