942. DI String Match

Given a string S that only contains "I" (increase) or "D" (decrease), let N = S.length.

Return any permutation A of [0, 1, ..., N] such that for all i = 0, ..., N-1:

  • If S[i] == "I", then A[i] < A[i+1]
  • If S[i] == "D", then A[i] > A[i+1]

 

Example 1:

Input: "IDID"
Output: [0,4,1,3,2]

Example 2:

Input: "III"
Output: [0,1,2,3]

Example 3:

Input: "DDI"
Output: [3,2,0,1]

 

Note:

  1. 1 <= S.length <= 10000
  2. S only contains characters "I" or "D".

942. DI String Match
struct Solution;

impl Solution {
    fn di_string_match(s: String) -> Vec<i32> {
        let n = s.len() + 1;
        let nums: Vec<i32> = (0..n).map(|i| i as i32).collect();
        let mut res: Vec<i32> = vec![];
        let mut l = 0;
        let mut r = n - 1;
        for c in s.chars() {
            match c {
                'I' => {
                    res.push(nums[l]);
                    l += 1;
                }
                'D' => {
                    res.push(nums[r]);
                    r -= 1;
                }
                _ => (),
            }
        }
        res.push(nums[l]);
        res
    }
}

#[test]
fn test() {
    let s = "IDID".to_string();
    let res = vec![0, 4, 1, 3, 2];
    assert_eq!(Solution::di_string_match(s), res);
    let s = "III".to_string();
    let res = vec![0, 1, 2, 3];
    assert_eq!(Solution::di_string_match(s), res);
    let s = "DDI".to_string();
    let res = vec![3, 2, 0, 1];
    assert_eq!(Solution::di_string_match(s), res);
}