791. Custom Sort String

S and T are strings composed of lowercase letters. In S, no letter occurs more than once.

S was sorted in some custom order previously. We want to permute the characters of T so that they match the order that S was sorted. More specifically, if x occurs before y in S, then x should occur before y in the returned string.

Return any permutation of T (as a string) that satisfies this property.

Example :
Input: 
S = "cba"
T = "abcd"
Output: "cbad"
Explanation: 
"a", "b", "c" appear in S, so the order of "a", "b", "c" should be "c", "b", and "a". 
Since "d" does not appear in S, it can be at any position in T. "dcba", "cdba", "cbda" are also valid outputs.

 

Note:

  • S has length at most 26, and no character is repeated in S.
  • T has length at most 200.
  • S and T consist of lowercase letters only.

Rust Solution

struct Solution;
use std::collections::HashMap;

impl Solution {
    fn custom_sort_string(s: String, t: String) -> String {
        let mut hm: HashMap<char, usize> = HashMap::new();
        for (i, c) in s.char_indices() {
            *hm.entry(c).or_default() = i;
        }
        let mut t: Vec<char> = t.chars().collect();
        t.sort_unstable_by_key(|c| hm.get(c).unwrap_or(&26));
        t.iter().collect()
    }
}

#[test]
fn test() {
    let s = "cba".to_string();
    let t = "abcd".to_string();
    let res = "cbad".to_string();
    assert_eq!(Solution::custom_sort_string(s, t), res);
}

Having problems with this solution? Click here to submit an issue on github.