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.
值得注意的是本题好像不能另外生成一个数组,让nums重新指向,最好是在原数组上修改数据
代码如下:
public class Solution {
public int removeElement(int[] nums, int val) {
if(nums.length==0 || nums==null) return 0;
int pos =0;
for(int i=0;i<nums.length;i++){
if(nums[i]!=val){
nums[pos++]=nums[i];
}
}
return pos;
}
}