LeetCode 27.Remove Element 移除数组中的元素

77 阅读 0 评论 51 点赞

我是靠谱客的博主动人母鸡，这篇文章主要介绍LeetCode 27.Remove Element 移除数组中的元素，现在分享给大家，希望可以做个参考。

文章目录

- - 移除元素
  - - 27. Remove Element
    - - 快慢双指针
      - 头尾双指针

移除元素

27. 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.

Example 1:

复制代码

1
2
3
4
5
6
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:

复制代码

1
2
3
4
5
6
7
8
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:

复制代码

1
2
3
4
5
6
7
8
9
// 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]);
}

快慢双指针

思路很简单，使用快指针的元素补充慢指针的元素。

复制代码

1
2
3
4
5
6
7
8
9
10
11
public int removeElement(int[] nums, int val) {
    int i = 0;
    for (int j = 0; j < nums.length; j++) {
        if (nums[j] != val) {
            nums[i] = nums[j];
            i++;
        }
    }
    return i;
}

头尾双指针

使用尾指针的元素补充头指针的元素。

复制代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
class Solution {
    public int removeElement(int[] nums, int val) {
        int resultLen = nums.length;
        int i = 0;
        int j = nums.length - 1;
        while(i <= j){
            
            if(nums[j] == val){
                j--;
                resultLen --;
                continue;
            }
            if(nums[i] == val && nums[j] != val){
                nums[i] = nums[j];
                i++;
                j--;
                resultLen--;
                continue;
            }
            i++;
        }
        return resultLen;
    }
}