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 by modifying the input array in-place with O(1) extra memory.

Example:

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 new length.

第一版:
Array-从有序数组删除重复项_第1张图片
第二版:

Array-从有序数组删除重复项_第2张图片

你可能感兴趣的:(算法与数据结构,leetcode全解)