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.
原地算法(in-place):将值赋值到原来的数组当中,目的是节省内存开支。
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.
代码实现
class Solution {
public int removeDuplicates(int[] nums) {
if (nums == null || nums.length == 0)
return 0;
int diffCount = 1;
// 遍历数组从第二个开始
for (int i=1; i<nums.length; i++) {
if (nums[i-1] == nums[i]) {
continue;
} else {//原地算法(就是将值赋值到原来的数组当中,节省内存开支)
nums[diffCount] = nums[i];
diffCount++;
}
}
return diffCount;
}
}