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.
1 class Solution { 2 public: 3 int removeElement(vector<int>& nums, int val) { 4 int size = nums.size();//获取数组长度,判断是否为空 5 if (size == 0) return 0; 6 for (int i = 0; i < nums.size(); i++) { //按要求删除数组中的元素 7 if (nums[i] == val) { 8 nums.erase(nums.begin() + i); 9 i--; //删除后 遍历器需要减一 10 } 11 } 12 return nums.size(); 13 } 14 };