[LeetCode]27. Remove Element 解题报告(C++)

[LeetCode]27. Remove Element 解题报告(C++)

题目描述

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.

题目大意

• 给定一个数组和要删除的数字.
• 就地修改输入数组,通过O(1)的额外空间.
• 注意,不需要数据保持输入时候的顺序.
• 返回删除完元素之后的长度.

解题思路

方法1:

• 暴力方法
• 前后交换.就是有条件要分析

代码实现:

class Solution0{
public:
    int removeElement(vector<int>& nums, int val) {
        int size = nums.size();
        if (size < 1) {
            return 0;
        }
        int i = 0, j = size-1;
        while (i < j) {
            if (nums[i] == val&&nums[j] != val) {
                swap(nums[i], nums[j]);
                i++;
            }
            else if (nums[i] == val&&nums[j] == val) {
                j--;
            }
            else if(nums[i] != val&&nums[j] != val){
                i++;
            }
            else { // num[i]!=val && num[j]==val
                j--;
            }
        }
        j = 1;
        while (nums[size- j]==val) {
            j++;
        }
        return (size - j + 1);
    }
};

方法2:

• 快慢指针
• 快指针找到非val的zhi,覆盖慢指针指向的值.

代码实现:

class Solution {
public:
    int removeElement(vector<int>& nums, int val) {
        int res = 0; // 慢指针
        // i快指针,找不同于val的值,覆盖慢指针的位置
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] != val) {
                nums[res] = nums[i];
                res++;
            }
        }
        return res;
    }
};

---

小结

• 快慢指针 真的很溜啊!!!