LeetCode - 26: Remove Duplicates from Sorted Array

26、Remove Duplicates from Sorted Array

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.

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

Solution-1 - Python:

def removeDuplicates(self, nums):
    """ :type nums: List[int] :rtype: int """
    nums[:] = list(set(nums))
    nums.sort()
    return len(nums)

Solution-2 - Python:

#!/usr/bin/env python
# -*- coding = utf-8 -*-

""" @ Create Time: 2018/4/28 @ Author: songpo.zhang @ Target: """

def removeDuplicates(nums):
    n = 0
    for i in range(1, len(nums)):
        if nums[n] != nums[i]:
            n += 1
            nums[n] = nums[i]
    return n + 1

nums = [1,1,1,2]
print((removeDuplicates(nums)))

不知道具体什么原因,在leetcode上提交时,第二种解法总是报错……

全部评论

相关推荐

迟缓的斜杠青年巴比Q了:简历被投过的公司卖出去了,我前两天遇到过更离谱的,打电话来问我有没有意向报班学Java学习,服了,还拿我学校一个学长在他们那报班学了之后干了华为OD当招牌
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务