26. Remove Duplicates from Sorted Array
参考 followup 问题：80. Remove Duplicates from Sorted Array II
Added solution on 2022/03/23
class Solution {
public int removeDuplicates(int[] nums) {
int i = 0;
for (int j = 0; j < nums.length; j++) {
if (i == 0 || nums[i - 1] != nums[j]) {
nums[i++] = nums[j];
}
}
return i;
}
}
Added Solution on 2019/03/14
class Solution {
public int removeDuplicates(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int j = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[j] != nums[i]) {
nums[++j] = nums[i];
}
}
return j + 1;
}
}
Previous Solution on 2019/02/18
class Solution:
def removeDuplicates(self, nums: 'List[int]') -> 'int':
if not nums or len(nums) < 2:
return len(nums)
j = 1
for i in range(1, len(nums)):
if nums[i] != nums[j - 1]:
nums[j] = nums[i]
j += 1
return j