Commit55fb6f8

authored

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

small refactor of the Rust code, now the code is a little bit more readable

1 parent410595a commit55fb6f8Copy full SHA for 55fb6f8

File tree

-9

lines changed

-9

lines changed

Lines changed: 7 additions & 9 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,19 +6,18 @@ impl Solution {`
`6`	`6`	`letmut map:HashMap<i32,i32> =HashMap::new();`
`7`	`7`
`8`	`8`	`for nin nums{`
`9`		`-*map.entry(n).or_default()+=1;`
	`9`	`+map.entry(n).and_modify(\|val\|val+=1).or_default();`
`10`	`10`	`}`
`11`	`11`
`12`	`12`	`letmut freq:Vec<(i32,i32)> = map.into_iter().collect();`
`13`	`13`
`14`		`-let res =if k == freq.len()asi32{`
`15`		`-&freq`
`16`		`-}else{`
`17`		`-quick_select(&mut freq, k)`
	`14`	`+let res =match(kasusize).cmp(&freq.len()){`
	`15`	`+Ordering::Equal =>&freq,`
	`16`	`+ _ =>quick_select(&mut freq, k),`
`18`	`17`	`};`
`19`	`18`
`20`	`19`	`res.into_iter()`
`21`		`-.map(\|&(n, _)\| n)`
	`20`	`+.map(\|&n\| n.0)`
`22`	`21`	`.collect()`
`23`	`22`	`}`
`24`	`23`	`}`
`@@ -29,12 +28,11 @@ pub fn quick_select(slice: &mut [(i32, i32)], k: i32) -> &[(i32, i32)]{`
`29`	`28`	`for indexin1..slice.len(){`
`30`	`29`	`if slice[index].1 >= slice[pivot].1{`
`31`	`30`	`slice.swap(index, j);`
`32`		`- j+=1;`
`33`	`31`	`}else{`
`34`	`32`	`slice.swap(index, i);`
`35`	`33`	`i+=1;`
`36`		`- j+=1;`
`37`	`34`	`}`
	`35`	`+ j+=1;`
`38`	`36`	`}`
`39`	`37`
`40`	`38`	`slice.swap(pivot, i -1);`
`@@ -47,4 +45,4 @@ pub fn quick_select(slice: &mut [(i32, i32)], k: i32) -> &[(i32, i32)]{`
`47`	`45`	`Ordering::Greater =>quick_select(&mut slice[pivot +1..j], k),`
`48`	`46`	`Ordering::Equal =>&slice[pivot..j],`
`49`	`47`	`}`
`50`		`-}`
	`48`	`+}`

Comments

(0)