Given an array and a value, 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.
Example:
Given nums = [3,2,2,3], val = 3, Your function should return length = 2, with the first two elements of nums being 2.
class Solution {
public int removeElement(int[] nums, int val) {
int l = 0;
for(int n:nums){
if(n!=val){
nums[l]=n;
l+=1;
}
}
return l;
}
}
解题思路:
遍历nums数组里面所有的数值,跟指定删除的值比较,若不同,写入nums数组的前几个数值覆盖之前的值,更新计数的值l
return l;
测试的时候应该是根据l来取nums数组里面前几位的数值作为输出的数组