905. 按奇偶排序数组

std::vector<int> Algorithm::sortArrayByParity(vector<int>& A)
{
	vector<int>::iterator itor = A.begin();
	vector<int> vecOdd;
	vector<int> vecEven;
	vector<int> vecAll;
	for (; itor != A.end(); itor++)
	{
		if (*itor % 2 == 0)
		{
			vecEven.push_back(*itor);
		}
		else
		{
			vecOdd.push_back(*itor);
		}
	}
	vecAll.insert(vecAll.end(), vecEven.begin(), vecEven.end());
	vecAll.insert(vecAll.end(), vecOdd.begin(), vecOdd.end());
	return vecAll;
}