-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathSolution.java
More file actions
39 lines (36 loc) · 1.17 KB
/
Solution.java
File metadata and controls
39 lines (36 loc) · 1.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
package removeelement;
/**
* Given an array nums and a value val, remove all instances of that value in-place and return the new length.
* <p>
* Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
* <p>
* The order of elements can be changed. It doesn't matter what you leave beyond the new length.
* <p>
* Example 1:
* <p>
* Given nums = [3,2,2,3], val = 3,
* <p>
* Your function should return length = 2, with the first two elements of nums being 2.
* <p>
* It doesn't matter what you leave beyond the returned length.
* Example 2:
* <p>
* Given nums = [0,1,2,2,3,0,4,2], val = 2,
* <p>
* Your function should return length = 5, with the first five elements of nums containing 0, 1, 3, 0, and 4.
* <p>
* Note that the order of those five elements can be arbitrary.
* <p>
* It doesn't matter what values are set beyond the returned length.
*/
class Solution {
public int removeElement(int[] nums, int val) {
int i = 0;
for (int j = 0; j < nums.length; j++) {
if (nums[j] != val) {
nums[i++] = nums[j];
}
}
return i;
}
}