Leetcode - Find the Duplicate Number
Leetcode - Interval List Intersections

Leetcode - Remove Duplicates from Sorted Array

violet posted @ Mar 24, 2020 12:53:05 AM in 算法 with tags Algorithm Golang array , 48 阅读

https://leetcode.com/problems/remove-duplicates-from-sorted-array/submissions/

Given a sorted array nums, 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.

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.

 

func removeDuplicates(nums []int) int {
    if len(nums) == 0 || len(nums) == 1{
        return len(nums)
    }
    left := 0
    right := 1
    for left < len(nums)-1 && right < len(nums) && left < right{
        for right < len(nums) && nums[left] == nums[right] {
            right++
        }
        if right >= len(nums) {
            break
        }
        left++

        nums[left] = nums[right]
        right++
    }
  
    return left+1
}

登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter