-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetCode27.java
More file actions
60 lines (55 loc) · 1.68 KB
/
LeetCode27.java
File metadata and controls
60 lines (55 loc) · 1.68 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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
import java.util.Arrays;
import util.PrintUtil;
public class LeetCode27 {
public static void main(String[] args) {
int len;
int[] nums;
int val;
// 输入:nums = [3,2,2,3], val = 3
// 输出:2, nums = [2,2]
nums = new int[] { 3, 2, 2, 3 };
val = 3;
System.out.println(Arrays.toString(nums));
len = new Solution27_2().removeElement(nums, val);
System.out.println(Arrays.toString(Arrays.copyOf(nums, len)));
PrintUtil.printDivider();
// 输入:nums = [0,1,2,2,3,0,4,2], val = 2
// 输出:5, nums = [0,1,3,0,4]
nums = new int[] { 0, 1, 2, 2, 3, 0, 4, 2 };
val = 2;
System.out.println(Arrays.toString(nums));
len = new Solution27_2().removeElement(nums, val);
System.out.println(Arrays.toString(Arrays.copyOf(nums, len)));
PrintUtil.printDivider();
}
}
class Solution27_1 {
public int removeElement(int[] nums, int val) {
int slow = 0;
int fast = 0;
while (fast < nums.length) {
if (nums[fast] != val) {
nums[slow] = nums[fast];
slow++;
}
fast++;
}
return slow;
}
}
class Solution27_2 {
public int removeElement(int[] nums, int val) {
int index = 0;
int deleted = nums.length;
while (index < deleted) {
if (nums[index] == val) {
nums[index] = nums[deleted - 1];
deleted -= 1;
} else {
index++;
}
// System.out.println(Arrays.toString(Arrays.copyOf(nums, deleted)));
}
return deleted;
}
}