[勇者闯LeetCode] 27. Remove Element

最新推荐文章于 2026-06-28 02:00:58 发布

原创最新推荐文章于 2026-06-28 02:00:58 发布 · 254 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

LeetCode

当前文章被收录于：

LeetCode

45 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍LeetCode第27题Remove Element的解题思路与实现方法，通过双指针技术在原地修改数组并返回新长度。

[勇者闯LeetCode] 27. Remove Element

Description

Given an array and a value, 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 in place with constant memory.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
Example:
Given input array nums = [3,2,2,3], val = 3
Your function should return length = 2, with the first two elements of nums being 2.

Information

Tags: Array | Two Pointers
Difficulty: Easy

Solution

使用两个指针分别表示当前扫描坐标和待替换元素的坐标，遇到需要移除的目标元素时进行元素替换，并更新指针。

class Solution(object):
    def removeElement(self, nums, val):
        """
        :type nums: List[int]
        :type val: int
        :rtype: int
        """
        i, n = 0, len(nums)
        while i < n:
            if nums[i] == val:
                n -= 1
                nums[i] = nums[n]
            else:
                i += 1
        return n