题目:
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.
解答:
遍历数组,和elem值不同的元素移到前面。
代码:
public class Solution {
public int removeElement(int[] A, int elem) {
if (A == null || A.length == 0)
return 0;
int start = 0;
for (int i = 0; i < A.length; i++) {
if (A[i] != elem) {
A[start] = A[i];
start++;
}
}
return start;
}
}