1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
| package algorithm;
public class RemoveDuplicatesFromSortedArray {
public static int removeDuplicates(int[] nums) {
if (nums == null) { return 0; } if (nums.length <= 1) { return 1; }
int start; int last; for (int i = 1; i < nums.length; i++) { start = i; while (i < nums.length && nums[i] == nums[i - 1]) { i++; } last = i; if (start == last) { continue; } copyNums(nums, start, last); i = start; }
int i = 1; int length = 1; while (i < nums.length && nums[i] > nums[i - 1]) { i++; length++; }
return length; }
private static void copyNums(int[] nums, int start, int last) { int space = last - start; for (; start < nums.length - space; start++, last++) { nums[start] = nums[last]; } }
public static void main(String[] args) {
int[] nums = new int[]{1,1,2}; print(nums, removeDuplicates(nums)); nums = new int[]{0,0,1,1,1,2,2,3,3,4}; print(nums, removeDuplicates(nums)); }
private static void print(int[] nums, int length) { for (int i = 0; i < length; i++) { System.out.print(nums[i]); } System.out.println(); } }
|