diff options
author | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
---|---|---|
committer | jack <[email protected]> | 2024-06-14 13:13:15 -0600 |
commit | d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa (patch) | |
tree | 96df922dae2a5073d9a50ea70c7aae6aa37e3ebe /contains_duplicate2.rs | |
download | leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.tar.gz leetcode-d343a3b18dbaca9297d4f7b2280c4a16f0a5c8aa.zip |
initial
Diffstat (limited to 'contains_duplicate2.rs')
-rw-r--r-- | contains_duplicate2.rs | 21 |
1 files changed, 21 insertions, 0 deletions
diff --git a/contains_duplicate2.rs b/contains_duplicate2.rs new file mode 100644 index 0000000..b016e21 --- /dev/null +++ b/contains_duplicate2.rs @@ -0,0 +1,21 @@ +use std::collections::HashMap; +struct Solution; + +impl Solution { + pub fn contains_nearby_duplicate(nums: Vec<i32>, k: i32) -> bool { + let mut hm = HashMap::new(); + for (i, n) in nums.iter().enumerate() { + if let Some(j) = hm.insert(n, i) { + if (i as i32) - (j as i32) <= k { + return true; + } + } + } + false + } +} + +fn main() { + let nums = vec![1,2,3,1]; + print!("{}", Solution::contains_nearby_duplicate(nums, 3)); +} |