标签:leetcode
链接:https://leetcode.com/problems/remove-element/
问题描述:
Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
Hide Tags Array Two Pointers
Hide Similar Problems (E) Remove Linked List Elements
这个题目要检查返回的两个量,一个是长度,一个是数组,数组中包含所有不等于val的变量,数组对顺序没有要求。用一个变量代表长度即可实现数组的修改,方法十分简单。
class Solution {
public:
int removeElement(vector<int>& nums, int val) {
int result=0;
for(int i=0;i<nums.size();i++)
{
if(nums[i]!=val)
nums[result++]=nums[i];
}
return result;
}
};
版权声明:本文为博主原创文章,未经博主允许不得转载。
标签:leetcode
原文地址:http://blog.csdn.net/efergrehbtrj/article/details/46861215