27.Remove Element

标签：

Given an array and a value, remove all instances of that value in placeand return the new length.

The order of elements can be changed. It doesn‘t matter what you leavebeyond the new length.

HideTags

 Array Two Pointer

#pragma once
#include<iostream>
#include<queue>
using namespace std;

int removeElement(int A[], int n, int elem) 
{
	if (n == 0)
		return 0;
	int p=0;
	int count = 0;
	for (int i = 0; i < n; i++)
	{
		if (A[i] != elem)
		{
			A[p] = A[i];
			p++;
			count++;
		}
	}
	return count;
}

void main()
{
	int A[] = { 2 };
	int result = removeElement(A, 1,3);
	for (int i = 0; i < result; i++)
		cout << A[i] << ' ';
	cout << endl;
	system("pause");
}

27.Remove Element

标签：

原文地址：http://blog.csdn.net/hgqqtql/article/details/43691727