Merge pull request #3056 from emanuele-em/patch-1

Update 0347-top-k-frequent-elements.rs

Author: felivalencia3

rust/0347-top-k-frequent-elements.rs

@@ -6,19 +6,18 @@ impl Solution {
         let mut map: HashMap<i32, i32> = HashMap::new();
 
         for n in nums{
-            *map.entry(n).or_default() +=1;
+            *map.entry(n).and_modify(|val| *val+=1).or_default();
         }
 
         let mut freq: Vec<(i32, i32)> = map.into_iter().collect();
 
-        let res = if k == freq.len() as i32{
-            &freq
-        }else{
-            quick_select(&mut freq, k)
+        let res = match (k as usize).cmp(&freq.len()){
+            Ordering::Equal => &freq,
+            _ => quick_select(&mut freq, k),
         };
 
         res.into_iter()
-        .map(|&(n, _)| n)
+        .map(|&n| n.0)
         .collect()
     }
 }
@@ -29,12 +28,11 @@ pub fn quick_select(slice: &mut [(i32, i32)], k: i32) -> &[(i32, i32)]{
     for index in 1..slice.len(){
         if slice[index].1 >= slice[pivot].1{
             slice.swap(index, j);
-            j+=1;
         }else{
             slice.swap(index, i);
             i+=1;
-            j+=1;
         }
+        j+=1;
     }
 
     slice.swap(pivot, i - 1);
@@ -47,4 +45,4 @@ pub fn quick_select(slice: &mut [(i32, i32)], k: i32) -> &[(i32, i32)]{
         Ordering::Greater => quick_select(&mut slice[pivot + 1..j], k),
         Ordering::Equal => &slice[pivot..j],
     }
-}
+}