LeetCode Easy Remove Element

最新推荐文章于 2022-10-26 15:28:02 发布

原创最新推荐文章于 2022-10-26 15:28:02 发布 · 163 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

31 篇文章

订阅专栏

本文介绍了一种高效的方法，用于在不使用额外空间的情况下从数组中删除特定值的所有实例，同时保持O(1)的额外内存消耗。通过两个解决方案的详细解析，读者将了解到如何利用双指针技术来修改输入数组，实现原地删除并返回新的数组长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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.

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]);
}

Solution1

public class Solution1 {
    /**
     * Two Pointers
     * @param nums
     * @param val
     * @return
     */
    public int removeElement(int[] nums, int val) {
        if (nums.length == 0) return 0;
        int left = 0, right = 0, ans = 0;
        while (left < nums.length && right < nums.length) {
            while (right < nums.length && nums[right] == val) right++;
            if (right >= nums.length) break;
            ans++;
            nums[left++] = nums[right++];
        }
        return ans;
    }
}

Solution2

public class Solution2 {
    /**
     * Solution1 cleaned
     * @param nums
     * @param val
     * @return
     */
    public int removeElemetn(int[] nums, int val) {
        if (nums == null || nums.length == 0) return 0;
        int i = 0;
        for (int j = 0; j < nums.length; j++) {
            if (nums[j] != val) {
                nums[i++] = nums[j];
            }
        }
        return i;
    }
}