forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
removeElement.cpp
29 lines (26 loc) · 815 Bytes
/
removeElement.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
// Source : https://oj.leetcode.com/problems/remove-element/
// Author : Hao Chen
// Date : 2014-06-19
/**********************************************************************************
*
* 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.
*
*
**********************************************************************************/
class Solution {
public:
int removeElement(int A[], int n, int elem) {
int tail = n-1;
int i = 0;
while ( i<=tail ){
if (A[i]==elem){
A[i] = A[tail--];
continue;
}
i++;
}
return tail+1;
}
};