[LeetCode 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:

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.

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.

 

分析

此题相比于的Remove Duplicates from Sorted Array难度要低一点。从数组中移除一个给定的val，其实就是把所有的nums[i] == val的值都移到数组的后面，很自然的就想到使用 i , j 两个index分别从首尾遍历，当遇到nums[j] != val && nums[i] == val时，交换两者。

 

Code

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

 

运行效率

Runtime: 4 ms, faster than 100.00% of C++ online submissions for Remove Element.

Memory Usage: 9 MB, less than 98.27% of C++ online submissions forRemove Element.