- LeetCod 80. Remove Duplicates fr
- 80. Remove Duplicates from Sorte
- 80.Remove Duplicates from Sorted
- 80. Remove Duplicates from Sorte
- 80. Remove Duplicates from Sorte
- Remove Duplicates from Sorted Ar
- 线性表-Remove Duplicates from Sorte
- 80. Remove Duplicates from Sorte
- Leetcode 80. Remove Duplicates f
- 80. Remove Duplicates from Sorte
描述
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 in place with constant memory.
For example, Given input array A = [1,1,2],
Your function should return length = 2, and A is now [1,2].
代码
package array;
public class RemoveDuplicates {
public static void main(String[] args) throws Exception {
int[] nums = {1,1,2,3,3,4};
int N = new RemoveDuplicates().removeDuplicates(nums);
for (int i = 0; i < N; i++)
System.out.print(nums[i] + " ");
}
public int removeDuplicates(int[] nums) {
if (nums.length == 1) return 1;
int size = 1;
for (int j = 0, i = 1; i < nums.length; i++) {
if (nums[i] != nums[i - 1]) {
size++;
j++;
nums[j] = nums[i];
}
}
return size;
}
}













网友评论