leetcode 第27题 c++

原题链接：力扣​​​​​​

这题的解法和leetcode-26题类似

#include <iostream>
#include<vector> 
#include<algorithm>
#include<unordered_map>
using namespace std;

int removeElement(vector<int>& nums, int val) {
	if (nums.size() == 0) return 0;

	vector<int>::iterator itor = nums.begin();
	while (itor != nums.end()){
		if (*itor != val){
			itor++;
		}
		else{
			itor = nums.erase(itor);
		}
	}
	return nums.size();
}


int main()
{
	vector<int> vec = { 0, 1, 2, 2, 3, 0, 4, 2 };
	int target = 2;
	int res = removeElement(vec, target);
	cout <<res<< endl;
	for (int i = 0; i < vec.size(); i++)
	{
		cout << vec[i] << endl;
	}
	system("pause");
	return 0;
}