Description
https://leetcode.com/problems/removeduplicatesfromsortedarray/
Given a sorted array nums, remove the duplicates inplace such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array inplace with O(1) extra memory.
Example 1:
Given 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 returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
It doesn’t matter what values are set beyond the returned length.
Clarification:
Confused why the returned value is an integer but your answer is an array?
Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.
Internally you can think of this:


Solution
Expalnation:
Because the question require that ‘Do not allocate extra space for another array, you must do this by modifying the input array inplace with O(1) extra memory’. We don’t have to delete the duplicates, we can overwrite the duplicates.
Full Code in Github :
https://github.com/younglaker/leetcode/blob/master/26_remove_duplicates_from_sorted_array.py
Example explanation
Exchange blogroll： http://laker.me/blog
Github：https://github.com/younglaker
本文原创自http://laker.me/blog，转载请注明出处，欢迎交换友链
如果本文对您有帮助，微信扫一扫，请我吃个鸡腿吧