-
Notifications
You must be signed in to change notification settings - Fork 0
/
intersection-of-two-arrays-ii.rs
47 lines (42 loc) · 1.24 KB
/
intersection-of-two-arrays-ii.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
struct Solution;
impl Solution {
pub fn intersect(nums1: Vec<i32>, nums2: Vec<i32>) -> Vec<i32> {
use std::collections::HashSet;
let (short, long) = if nums1.len() > nums2.len() {
(nums2, nums1)
} else {
(nums1, nums2)
};
let mut ans: HashSet<(i32, usize)> = HashSet::new();
for i in short {
for (j, v) in long.iter().enumerate() {
if i == *v && ans.insert((i, j)) {
break;
}
}
}
ans.into_iter().map(|(i, _)| i).collect::<Vec<i32>>()
}
}
fn main() {
println!("{:?}", Solution::intersect(vec![1, 2, 2, 1], vec![2, 2]));
}
#[cfg(test)]
mod tests {
use crate::Solution;
#[test]
fn test_impl1() {
let tuple = vec![
(vec![1, 2, 2, 1], vec![2, 2], vec![2, 2]),
(vec![4, 9, 5], vec![9, 4, 9, 8, 4], vec![4, 9]),
(vec![1, 1, 1], vec![1], vec![1]),
(vec![1], vec![1], vec![1]),
(vec![3, 1, 2], vec![1, 1], vec![1]),
];
for (nums1, nums2, result) in tuple {
let mut r = Solution::intersect(nums1, nums2);
r.sort_unstable();
assert_eq!(r, result);
}
}
}