LeetCode-27 Remove Element

Description

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.

Clarification:
Confused why the returned value is an integer but your answer is an array?
Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.
Internally you can think of this:

// nums is passed in by reference. (i.e., without making a copy)
int len = removeElement(nums, val);

// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
    print(nums[i]);
}

Example

Example 1:
Given nums = [3,2,2,3], val = 3,
Your function should return length = 2, with the first two elements of nums being 2.
It doesn’t matter what you leave beyond the returned length.

Example 2:
Given nums = [0,1,2,2,3,0,4,2], val = 2,
Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.
Note that the order of those five elements can be arbitrary.
It doesn’t matter what values are set beyond the returned length.

Submissions

起初我的思路很简单遍历列表,等于给出的val即删除,代码如下:

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        for i in range(len(nums)-1):
            if nums[i] == val:
                del nums[i]
        return len(nums)

但是出现了一个很明显的错误,例如用例[0,1,2,2,3,0,4,2],val为2,按上述代码则输出[0,1,2,3,0,4],因为两个连续的数字都等于val时,删除一个另一个的索引位置自动前移不再遍历,所以解法错误。
因此与上一题类似,依旧定义了两个指针i和j,总体思路是将不等于val的值移到列表的前面,等于val的值后移。具体操作即比较j指向的值是否等于val,若相等则j向后移一个元素,若不相等则将j指向的值赋给i指向的元素。i,j依次后移,遍历完成后,返回前i的列表的长度。
实现代码如下:

class Solution:
    def removeElement(self, nums: List[int], val: int) -> int:
        i=j=0
        while j<len(nums):
            if nums[j]==val:
                j+=1
            else:
                nums[i]=nums[j]
                i+=1
                j+=1
                
        return len(nums[0:i])
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值