aboutsummaryrefslogtreecommitdiff
path: root/top_k_freq_element.rs
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
committerJack Sangdahl <[email protected]>2025-03-10 00:36:13 -0600
commit7c60dee83b436e8e8a667bf9f191beced8de4fc3 (patch)
treeeb7a24ee2067f92245c57bb118e85a1baf15df50 /top_k_freq_element.rs
parent5d7cdc215e4ba1ec4cbb24c084cccb5e5e641468 (diff)
downloadleetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.tar.gz
leetcode-7c60dee83b436e8e8a667bf9f191beced8de4fc3.zip
chore: move cpp and rust code to directory
Diffstat (limited to 'top_k_freq_element.rs')
-rw-r--r--top_k_freq_element.rs32
1 files changed, 0 insertions, 32 deletions
diff --git a/top_k_freq_element.rs b/top_k_freq_element.rs
deleted file mode 100644
index 82a2b03..0000000
--- a/top_k_freq_element.rs
+++ /dev/null
@@ -1,32 +0,0 @@
-//347. Top K Frequent Elements
-struct Solution;
-
-/*
-* given an integer array 'nums' and an integer 'k', return the 'k' most frequent elements. you may
-* return the answer in any order.
-*/
-
-impl Solution {
- pub fn top_k_frequent(nums: Vec<i32>, k: i32) -> Vec<i32> {
- let mut map = std::collections::HashMap::new();
- for x in nums {
- *map.entry(x).or_insert(0) += 1;
- }
- let mut arr = map.into_iter().collect::<Vec<(i32,i32)>>();
- arr.sort_by(|a,b| 1.1.cmp(&b.1));
- arr.reverse();
- let k = k as usize;
- let mut ans = vec![0;k];
- for i in 0..k {
- ans[i] = arr[i].0;
- }
- ans
- }
-}
-
-fn main() {
- let n1 = vec![1,1,1,2,2,3];
- let n2 = vec![1];
- print!("{}", Solution::top_k_frequent(n1, 2)); //expect: [1,2]
- print!("{}", Solution::top_k_frequent(n2, 1)); //expect: [1]
-}