diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/contains_duplicate2.rs | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/contains_duplicate2.rs')
-rw-r--r-- | other/contains_duplicate2.rs | 21 |
1 files changed, 0 insertions, 21 deletions
diff --git a/other/contains_duplicate2.rs b/other/contains_duplicate2.rs deleted file mode 100644 index b016e21..0000000 --- a/other/contains_duplicate2.rs +++ /dev/null @@ -1,21 +0,0 @@ -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)); -} |