LeetCode刷题笔记（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:

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

解答如下：

方法一

解答如下：

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int res = 0;//用于记录存放非val值的下标
        for (int i = 0; i < nums.size(); ++i) {
            if (nums[i] != val) 
                nums[res++] = nums[i];//此处直接覆盖
        }
        return res;
    }
};

提交后的结果如下：

方法二

在方法一的基础上，将直接赋值换成了交换，大大提高了运行时间。

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int res = 0;
        for (int i = 0; i < nums.size(); ++i) {
            if (nums[i] != val) 
               swap( nums[res++], nums[i]);//交换比直接覆盖更省时间
        }
        return res;
    }
};

提交后的结果如下：

方法三；

在方法二的基础上，进一步改进代码避免了nums中并不包括val值的极端情况。

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int res = 0;
        for (int i = 0; i < nums.size(); ++i) {
            {
               if (nums[i] != val) 
                    if(i != res)//避免在nums中没有val值时，i和res同时指向一个数，白白扫一遍数组
                      swap( nums[res++], nums[i]);
                    else
                        res++;//为了保证与i同步增长
            }
        }
        return res;
    }
};

提交后的结果如下：

20220222

重刷方法

class Solution {
public:
    int removeElement(vector<int>& nums, int val){
        int k = 0;
        for(int i=0; i<nums.size(); i++){
            if(nums[i]!=val){
                if(i!=k){
                   swap(nums[k++], nums[i]); 
                }
                else{
                    k++;
                }
            }
        }
     return k;
    }
};

日积月累，与君共进，增增小结，未完待续。