※ 引述《yam276 (虚构史学家)》之铭言：
: ※ 引述《sustainer123 (caster )》之铭言：
: : https://leetcode.com/problems/relative-sort-array
: : 1122. Relative Sort Array
: : 给定两数列arr1与arr2 arr2的元素不重复且皆存在于arr1
: : 请依照arr2的顺序排列arr1的元素
: : 假设有元素不在arr2 请递增排序
: → yam276: 感觉我脱裤子放屁 我哭了 06/11 15:35
来看其他大师变魔术
Code:
impl Solution {
pub fn relative_sort_array(mut arr1: Vec<i32>, arr2: Vec<i32>) -> Vec<i32>
{
let mut idx_arr = [-1; 1001];
for (n, i) in arr2.into_iter().zip(0..) {
idx_arr[n as usize] = i;
}
arr1.sort_unstable_by(|a, b| {
use std::cmp::Ordering::*;
match (idx_arr[*a as usize], idx_arr[*b as usize]) {
(-1, -1) => a.cmp(b),
(-1 , _) => Greater,
(_, -1) => Less,
(i, j) => i.cmp(&j),
}
});
arr1
}
}
太狠了 堪称高阶魔法师