forked from TonnyL/Windary
-
Notifications
You must be signed in to change notification settings - Fork 0
/
0217_contains_duplicate.rs
55 lines (48 loc) · 1.1 KB
/
0217_contains_duplicate.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
//! Given an array of integers, find if the array contains any duplicates.
//!
//! Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.
//!
//! Example 1:
//! ```
//! Input: [1,2,3,1]
//! Output: true
//! ```
//!
//! Example 2:
//!
//! ```
//! Input: [1,2,3,4]
//! Output: false
//! ```
//!
//! Example 3:
//! ```
//! Input: [1,1,1,3,3,4,3,2,4,2]
//! Output: true
//! ```
//!
use std::collections::HashSet;
use std::iter::FromIterator;
struct Solution;
impl Solution {
pub fn contains_duplicate(nums: Vec<i32>) -> bool {
let map: HashSet<i32> = HashSet::from_iter(nums.clone());
nums.len() != map.len()
}
}
#[cfg(test)]
mod tests {
use super::Solution;
#[test]
fn test_0() {
assert_eq!(Solution::contains_duplicate(vec![1, 2, 3, 1]), true);
}
#[test]
fn test_1() {
assert_eq!(Solution::contains_duplicate(vec![1, 2, 3, 4]), false);
}
#[test]
fn test_2() {
assert_eq!(Solution::contains_duplicate(vec![1, 1, 1, 3, 3, 4, 3, 2, 4, 2]), true)
}
}