26. Remove Duplicates from Sorte

作者: AnakinSun | 来源:发表于2019-03-22 13:28 被阅读1次

26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte

两个指针一起前进

func removeDuplicates(nums []int) int {
    for i, j := 0, 1; i < j && j < len(nums); {
        if nums[j] == nums[i] {
            nums = append(nums[:i], nums[i+1:]...)
            j--
            i--
        }
        j++
        i++
    }
    return len(nums)
}

26. Remove Duplicates from Sorte
Problem Given a sorted array nums, remove the duplicates ...
26. Remove Duplicates from Sorte
https://leetcode.com/problems/remove-duplicates-from-sort...
26. Remove Duplicates from Sorte
Description Given a sorted array, remove the duplicates i...
26. Remove Duplicates from Sorte
解法1：使用k指针存储不重复的元素解法2：使用LinkedHashSet
26. Remove Duplicates from Sorte
一个排序数组，移除重复的项，返回新的长度。不可以使用额外的数组空间，空间复杂度为O(1)。解析：不可以声明新的...
26. Remove Duplicates from Sorte
Remove Duplicates from Sorted Array时间：20180312 思路：用双指针处理数...
26. Remove Duplicates from Sorte
题目简介 Given a sorted array, remove the duplicates in place...
26. Remove Duplicates from Sorte
题目如下： Given a sorted array, remove the duplicatesin-place...
26. Remove Duplicates from Sorte
26. Remove Duplicates from Sorte
Description: Given a sorted array, remove the duplicates ...