10.25-数组-练习题2

Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.

Consider the number of elements in nums which are not equal to val be k, to get accepted, you need to do the following things:

• Change the array nums such that the first k elements of nums contain the elements which are not equal to val. The remaining elements of nums are not important as well as the size of nums.
• Return k.

Custom Judge:

The judge will test your solution with the following code:

int[] nums = [...]; // Input array
int val = ...; // Value to remove
int[] expectedNums = [...]; // The expected answer with correct length.
                            // It is sorted with no values equaling val.

int k = removeElement(nums, val); // Calls your implementation

assert k == expectedNums.length;
sort(nums, 0, k); // Sort the first k elements of nums
for (int i = 0; i < actualLength; i++) {
    assert nums[i] == expectedNums[i];
}

If all assertions pass, then your solution will be accepted.

Example 1:

Input: nums = [3,2,2,3], val = 3
Output: 2, nums = [2,2,_,_]
Explanation: Your function should return k = 2, with the first two elements of nums being 2.
It does not matter what you leave beyond the returned k (hence they are underscores).

Example 2:

Input: nums = [0,1,2,2,3,0,4,2], val = 2
Output: 5, nums = [0,1,4,0,3,_,_,_]
Explanation: Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4.
Note that the five elements can be returned in any order.
It does not matter what you leave beyond the returned k (hence they are underscores).

Constraints:

• 0 <= nums.length <= 100
• 0 <= nums[i] <= 50
• 0 <= val <= 100

这道题应该想到双指针，即快慢指针法，因为传统的需要双循环，而双循环需要让外循环的i和数组大小处于在一个动态的过程中：

class Solution {

public:

    int removeElement(vector<int>& nums, int val) {

        int size = nums.size();

        for (int i = 0; i < size; i++) {

            if (nums[i] == val) { // 发现需要移除的元素，就将数组集体向前移动一位

                for (int j = i + 1; j < size; j++) {

                    nums[j - 1] = nums[j];

                }

                i--; // 因为下标i以后的数值都向前移动了一位，所以i也向前移动一位

                size--; // 此时数组的大小-1

            }

        }

        return size;

    }

};

而双指针不用这么麻烦，快指针负责找到第一个不等于val的数值，并替换到慢指针的位置上，然后快慢指针均加一：

       

class Solution {

public:

    int removeElement(vector<int>& nums, int val) {

        int slowIndex = 0;

        for (int fastIndex = 0; fastIndex < nums.size(); fastIndex++) {

            if (val != nums[fastIndex]) {

                nums[slowIndex++] = nums[fastIndex];

            }

        }

        return slowIndex;

    }

};

双指针需要好好掌握