leetcode - 26.Remove Duplicates from Sorted Array
2017-03-02 19:54
375 查看
Remove Duplicates from Sorted Array
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.
Solution:
public int removeDuplicates(int[] nums) { int i = nums.length > 0 ? 1 : 0; for (int n : nums) if (n > nums[i - 1]) nums[i++] = n; return i; }
相关文章推荐
- leetcode-java-26. Remove Duplicates from Sorted Array
- leetcode26:Remove Duplicates from Sorted Array
- leetcode - 26 Remove Duplicates from Sorted Array
- leetcode 26. Remove Duplicates from Sorted Array
- leetcode26 Remove Duplicates from Sorted Array 去重已排序列表
- leetcode 26 Remove Duplicates from Sorted Array
- leetCode 26.Remove Duplicates from Sorted Array(删除数组重复点) 解题思路和方法
- LeetCode - 26. Remove Duplicates from Sorted Array
- [LeetCode] 26.Remove Duplicates from Sorted Array
- [leetcode]: 26. Remove Duplicates from Sorted Array
- [LeetCode]26.Remove Duplicates from Sorted Array
- LeetCode: 26. Remove Duplicates from Sorted Array
- LeetCode 26. Remove Duplicates from Sorted Array(移除有序数组的重复元素)
- LeetCode 26 Remove Duplicates from Sorted Array
- LeetCode-26 Remove Duplicates from Sorted Array(水题-去相同元素)
- [leetcode]--26. Remove Duplicates from Sorted Array
- LeetCode 26. Remove Duplicates from Sorted Array 题解——Java
- [LeetCode]--26. Remove Duplicates from Sorted Array
- LeetCode_26---Remove Duplicates from Sorted Array
- LeetCode - 26. Remove Duplicates from Sorted Array