Remove Duplicates from Sorted Array Easy
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 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.
public int removeDuplicates(int[] nums) { if (nums == null || nums.length == 0) return 0; int temp = nums[0], cur; int count = 1; for (int i = 1; i < nums.length; ++i) { cur = nums[i]; if (temp != cur) { nums[count++] = cur; } temp = cur; } return count; }
思路:顺序找即可,先检查为空情况。如果不空,保留第一元素(计数1),顺序处理后续元素,如遇与当前不同则记入原数组头部并计数。