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

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

 

Example 1:

Input: nums = [3,2,2,3], val = 3
Output: 2, nums = [2,2]
Explanation: 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. For example if you return 2 with nums = [2,2,3,3] or nums = [2,2,0,0], your answer will be accepted.

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

解题思路：

此题的思路就是使用两个标识，其中一个标识j表示目前不同于元素Val 的目前元素的个数（也可作为存放不同val元素的起始位置），另外一个标识i用于遍历数组元素去遍历nums。大概过程如下，实际上的结果就是nums中不同于val的元素都被放在了nums前面的位置中。

（1）定义j=0；用来记录数组中不等于val的元素的个数；

（2）从头开始遍历数组i=0，若数组中元素与val不相等（即nums[i]!=val）则将nums[i]赋给nums[j],然后将j+1;然后执行下一次循环；若数组中元素与val值相等即（nums[i]==val），则执行下一次循环直到循环执行结束；

  (3）最后返回j

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