-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlib.rs
83 lines (66 loc) · 2.06 KB
/
lib.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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
// https://leetcode.com/problems/3sum/
pub struct Solution;
impl Solution {
// O(n²)
pub fn three_sum(mut nums: Vec<i32>) -> Vec<Vec<i32>> {
use std::{cmp::Ordering, collections::HashSet};
let len = nums.len();
// O(n)
if len == 3 {
if nums.iter().sum::<i32>() == 0 {
return vec![nums];
} else {
return vec![];
}
}
nums.sort_unstable(); // O(nlogn)
let mut res = HashSet::<Vec<i32>>::with_capacity(len / 3);
// O(n²)
for left in 0..len - 2 {
let mut middle = left + 1;
let mut right = len - 1;
while middle < right {
match (nums[middle] + nums[right]).cmp(&-nums[left]) {
Ordering::Less => middle += 1,
Ordering::Equal => {
res.insert(vec![nums[left], nums[middle], nums[right]]);
middle += 1;
right -= 1;
}
Ordering::Greater => right -= 1,
}
}
}
// O(n)
res.into_iter().collect()
}
}
#[cfg(test)]
mod tests {
use super::*;
fn assert_eq_unordered(a: Vec<Vec<i32>>, b: Vec<Vec<i32>>) {
let a = a.iter().collect::<std::collections::HashSet<_>>();
let b = b.iter().collect::<std::collections::HashSet<_>>();
assert_eq!(a, b);
}
#[test]
fn no_results() {
let res = Solution::three_sum(vec![0, 1, 1]);
assert_eq_unordered(res, Vec::new());
}
#[test]
fn one_result() {
let res = Solution::three_sum(vec![-1, 0, 1]);
assert_eq_unordered(res, vec![vec![-1, 0, 1]]);
}
#[test]
fn two_results() {
let res = Solution::three_sum(vec![-1, 0, 1, 2, -1, -4]);
assert_eq_unordered(res, vec![vec![-1, -1, 2], vec![-1, 0, 1]]);
}
#[test]
fn three_zeros() {
let res = Solution::three_sum(vec![0, 0, 0]);
assert_eq_unordered(res, vec![vec![0, 0, 0]]);
}
}