-
Notifications
You must be signed in to change notification settings - Fork 0
/
contains-duplicate-ii.rs
69 lines (59 loc) · 1.6 KB
/
contains-duplicate-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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#![allow(unused)]
struct Solution;
impl Solution {
fn test(self) -> Self {
println!("1");
if (true) {
return self;
}
self
}
pub fn impl1(nums: Vec<i32>, k: i32) -> bool {
for i in 0..nums.len() - 1 {
for j in i + 1..nums.len() {
if nums[i] == nums[j] && (i as i32 - j as i32).abs() <= k {
return true;
}
}
}
false
}
pub fn impl2(nums: Vec<i32>, k: i32) -> bool {
use std::collections::HashMap;
let mut map: HashMap<i32, usize> = HashMap::new();
for (i, v) in nums.iter().enumerate() {
if let Some(x) = map.get_mut(v) {
if (i as i32 - *x as i32).abs() <= k {
return true;
}
*x = i;
} else {
map.insert(*v, i);
}
}
false
}
pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool {
Solution::impl1(nums, k)
}
}
#[cfg(test)]
mod tests {
use crate::Solution;
#[test]
fn test_impl1() {
let s = Solution;
// Solution::test("");
s.test();
assert!(Solution::impl1(vec![1, 2, 3, 1], 3));
assert!(Solution::impl1(vec![1, 0, 1, 1], 1));
assert!(!Solution::impl1(vec![1, 2, 3, 1, 2, 3], 2));
}
#[test]
fn test_impl2() {
assert!(Solution::impl2(vec![1, 2, 3, 1], 3));
assert!(Solution::impl2(vec![1, 0, 1, 1], 1));
assert!(!Solution::impl2(vec![1, 2, 3, 1, 2, 3], 2));
}
}
fn main() {}