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 in place with constant memory.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
Example:
Given input array nums = [3,2,2,3], val = 3Your function should return length = 2, with the first two elements of nums being 2.
不得不吐槽这原题题意混乱。。。
遍历 nums,遇到与 val 不同的值,把 i 位置的值提到 length 位置去,长度加一。代码如下:
public class Solution {
public int removeElement(int[] nums, int val) {
int length = 0;
for(int i = 0; i < nums.length; i++) {
if(nums[i] != val) {
nums[length] = nums[i];
length++;
}
}
return length;
}
}