Leetcode日练笔记15 #27 # 26 Remove Element & Remove Duplicates from Sorted Array

#27 Remove Element

Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums.

Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

解题思路:

占了python del 功能的好处。一删完一个元素,下一个自动靠拢。所以就比较简单。

用while循环查找val在nums里的index,然后用del 删掉。最后输出nums的长度。

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        while val in nums:
            del_idx = nums.index(val)
            del nums[del_idx]
        return len(nums)

runtime:

#26 Remove Duplicates from Sorted Array

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums.

Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.

解题思路:

两个pointer,比较左右值,相等则删掉右值。不等则左标右标都右移一位。最后右标超出nums长度则停止循环。

class Solution:
    def removeDuplicates(self, nums: List[int]) -> int:
        left, right = 0, 1
        while right < len(nums):
            if nums[left] == nums[right]:
                del nums[right]
            else:
                left += 1
                right += 1
        return len(nums)

runtime:

看了一下65ms的solution:

这个思路相比之下,快在不删掉重复的值,而是直接不同的才挪坑改值。pointer的作用是保留unique的值。最后看pointer停留在idx的位置。确实步骤省了很多。瑞思拜。

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值