algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 21:10:58 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1976 from fwqaaq/patch-23

Browse Source 
Update 0406.根据身高重建队列.md 优化 rust
This commit is contained in:
程序员Carl
2023-05-24 09:16:29 +08:00
committed by GitHub
parent 3f4968a0ca f51f31290f
commit 2b2fd97fe4
1 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
problems/0406.根据身高重建队列.md
View File

@ -295,19 +295,19 @@ var reconstructQueue = function(people) {
```Rust ```Rust
impl Solution { impl Solution {
pub fn reconstruct_queue(people: Vec<Vec<i32>>) -> Vec<Vec<i32>> { pub fn reconstruct_queue(mut people: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
let mut people = people; let mut queue = vec![];
people.sort_by(|a, b| { people.sort_by(|a, b| {
if a[0] == b[0] { return a[1].cmp(&b[1]); } if a[0] == b[0] {
return a[1].cmp(&b[1]);
}
b[0].cmp(&a[0]) b[0].cmp(&a[0])
}); });
let mut que: Vec<Vec<i32>> = Vec::new(); queue.push(people[0].clone());
que.push(people[0].clone()); for v in people.iter().skip(1) {
for i in 1..people.len() { queue.insert(v[1] as usize, v.clone());
let position = people[i][1];
que.insert(position as usize, people[i].clone());
} }
que queue
} }
} }
``` ```