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 being1 and 2 respectively. It doesn't matter what you leave beyond the new length.
解题思路：
这道题没啥好说的，记得更新nums就好了。
[java] view plain copy print ? public class Solution { public int removeDuplicates(int[] nums) { if(nums.length == 0) return 0; int k = 1; int result = 1; while(k<nums.length) { if(nums[k] != nums[k-1]) { result++; nums[result-1] = nums[k]; } k++; } return result; } } public class Solution { public int removeDuplicates(int[] nums) { if(nums.length == 0) return 0; int k = 1; int result = 1; while(k<nums.length) { if(nums[k] != nums[k-1]) { result++; nums[result-1] = nums[k]; } k++; } return result; } }
