题目描述:Given an array nums and a value val, remove all instances of that value in-place and return the new length.
Do not allocate extra space for another array, you must do this by
modifying the input array in-place with O(1) extra memory.The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
解题思路:遍历整个数组,记录不是给定元素的坐标。返回坐标值+1。
代码如下:
class Solution {
public int removeElement(int[] nums, int val) {
int len = nums.length;
if(len==0||nums==null) return 0;
int j=0;
for(int i=0;i<len;i++){
if(nums[i]!=val){
nums[j++]=nums[i];
}
}
return j;
}
}