id 1406181370 Time: 8 ms MemUsage: 3.2 MB

leetcode/contains-duplicate/solution_1406181370.rs

@@ -0,0 +1,8 @@
+use std::collections::HashSet;
+
+impl Solution {
+    pub fn contains_duplicate(nums: Vec<i32>) -> bool {
+        let mut already_visit = HashSet::with_capacity(nums.len());;
+        nums.into_iter().any(|num| !already_visit.insert(num))
+    }
+}