-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathRemoveElement.java
More file actions
31 lines (25 loc) · 1019 Bytes
/
Copy pathRemoveElement.java
File metadata and controls
31 lines (25 loc) · 1019 Bytes
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
// 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.
// See: https://leetcode.com/problems/remove-element/
// Almost the same problem is here: See: https://leetcode.com/problems/move-zeroes/
package leetcode.array_and_hashtable;
public class RemoveElement {
public int removeElement(int[] nums, int val) {
int pivot = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] != val) {
nums[pivot] = nums[i];
pivot++;
}
}
return pivot;
}
public static void main(String[] args) {
RemoveElement sln = new RemoveElement();
System.out.println(sln.removeElement(new int[] { 3, 2, 2, 3 }, 3));
}
}