【Leetcode】027. Remove Element


问题描述

Given an array nums and a value val, remove all instances of that value in-place 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.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length

对于给定的输入nums和一个val值,删除nums中所有值为val的元素,返回操作后的array的长度

例子

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.

2019-06-08 单指针遍历,单指针记录
		index = 0
        for i in range(len(nums)):
            if nums[i]!=val:
                nums[index] = nums[i]
                index = index + 1
        print(nums[:index])
        return len(nums[:index])
结果分析

Runtime: 16 ms, faster than 95.94% of Python online submissions for Remove Element.
Memory Usage: 11.8 MB, less than 25.84% of Python online submissions for Remove Element.

直接删除元素
		i = 0
        while i<len(nums):
            if nums[i]!=val:
                i = i + 1
            else:
                del nums[i]
                # i = i +1

        # print(nums)
        return  len(nums)
结果分析

Runtime: 20 ms, faster than 88.54% of Python online submissions for Remove Element.
Memory Usage: 11.7 MB, less than 56.00% of Python online submissions for Remove Element.

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

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值