题目描述:
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.
思路解析:
- 直接从前向后遍历,遇到不是给出的value就赋值
- 需要一个新的index来表示新数组的长度
代码:
public class Solution {
public int removeElement(int[] A, int elem) {
if(A==null||A.length==0)
return 0;
int m=0;
for(int i=0;i<A.length;i++){
if(A[i]!=elem){
A[m]=A[i];
m++;
}
}
return m;
}
}