# LeetCode - 0942. DI String Match
### 題目網址：https://leetcode.com/problems/di-string-match/
###### tags: `LeetCode` `Easy` `貪心演算法（Greedy Algorithm）`

/*
    -LeetCode format-
    Problem: 942. DI String Match
    Difficulty: Easy
    
    by Inversionpeter
*/



class Solution {
public:
    vector<int> diStringMatch(string S) {
        int lower = 0, upper = S.size();
        vector <int> sequence;
        for (char &state : S)
            if (state == 'I') {
                sequence.push_back(lower);
                ++lower;
            }
            else {
                sequence.push_back(upper);
                --upper;
            }
        sequence.push_back(lower);
        return sequence;
    }
};