-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathfind_duplicates.rs
46 lines (37 loc) · 978 Bytes
/
find_duplicates.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
// 442. Find All Duplicates in an Array, Medium
// https://leetcode.com/problems/find-all-duplicates-in-an-array/
impl Solution {
pub fn find_duplicates(mut nums: Vec<i32>) -> Vec<i32> {
nums.sort_unstable();
let mut ans = vec![];
let n = nums.len();
if n == 0 {
return ans;
}
let mut prev = nums[0];
for i in 1..n {
if nums[i] == prev {
ans.push(nums[i]);
}
prev = nums[i];
}
ans
}
}
struct Solution {}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_find_duplicates() {
assert_eq!(Solution::find_duplicates(vec![4, 3, 2, 7, 8, 2, 3, 1]), vec![2, 3]);
}
#[test]
fn test_find_duplicates2() {
assert_eq!(Solution::find_duplicates(vec![1, 1, 2]), vec![1]);
}
#[test]
fn test_find_duplicates3() {
assert_eq!(Solution::find_duplicates(vec![1]), vec![]);
}
}