public class Solution {
/**
*@param A: A list of integers
*@param elem: An integer
*@return: The new length after remove
*/
public int removeElement(int[] A, int elem) {
// write your code here
if (A == null || A.length == 0) {
return 0;
}
int i = 0;
int pointer = A.length - 1;
while (i <= pointer) {
if (A[i] == elem) {
A[i] = A[pointer];
pointer--;
} else {
i++;
}
}
return i;
}
}
2016年6月19日星期日
[LintCode] #172 Remove Element
http://www.lintcode.com/en/problem/remove-element/
订阅:
博文评论 (Atom)
没有评论:
发表评论