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/top_k_freq_element.rs | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/top_k_freq_element.rs')
-rw-r--r-- | other/top_k_freq_element.rs | 32 |
1 files changed, 0 insertions, 32 deletions
diff --git a/other/top_k_freq_element.rs b/other/top_k_freq_element.rs deleted file mode 100644 index 82a2b03..0000000 --- a/other/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] -} |