-
Notifications
You must be signed in to change notification settings - Fork 2
/
0015-3sum.rs
50 lines (45 loc) · 1.42 KB
/
0015-3sum.rs
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
struct Solution;
impl Solution {
pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
nums.sort();
let mut result: Vec<Vec<i32>> = Vec::new();
let n = nums.len();
let mut i: usize = 0;
while i < n {
let target = -nums[i];
let mut front = i + 1;
let mut back = n - 1;
while front < back {
let sum = nums[front] + nums[back];
if sum < target {
front += 1;
} else if sum > target {
back -= 1;
} else {
let triplet = vec![nums[i], nums[front], nums[back]];
// ignore duplicates of second number
while front < back && nums[front] == triplet[1] {
front += 1;
}
// ignore duplicates of third number
while front < back && nums[back] == triplet[2] {
back -= 1;
}
result.push(triplet);
}
}
// ignore duplicates of first number
while i + 1 < n && nums[i + 1] == nums[i] {
i += 1;
}
i += 1;
}
result
}
}
fn main() {
assert_eq!(
vec![vec![-1, -1, 2], vec![-1, 0, 1]],
Solution::three_sum(vec![-1, 0, 1, 2, -1, -4])
);
}