1
class Solution {
2
public int removeElement(int[] nums, int val) {
3
int ind = 0;
4
for (int i = 0; i < nums.length; i++) {
5
if (nums[i] != val) {
6
nums[ind++] = nums[i];
7
}
8
}
9
return ind;
10
}
11
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0