golang 解法, 执行用时: 152 ms, 内存消耗: 6.1 MB, 提交时间: 2023-10-22 10:54:28

func findPermutation(s string) []int {
    ans := make([]int, len(s)+1)
    for i:=0; i<len(ans); i++ { 
        ans[i] = i+1
    }
    flag := true //用来判断是否有变动
    for flag { //如果没有变动了，则返回
        flag = false
        for i,j:=0,1; i<len(s)&&j<=len(s); i,j=i+1,j+1 {
            if (s[i] == 'D' && ans[i] < ans[j]) || (s[i] == 'I' && ans[i] > ans[j]) {
                ans[i], ans[j] = ans[j], ans[i]
                flag = true
            }
        }
    }
    
    return ans 
}

cpp 解法, 执行用时: 8 ms, 内存消耗: 10.4 MB, 提交时间: 2023-10-22 10:53:59

class Solution {
public:
    vector<int> findPermutation(string s) {
        vector<int> res;
        stack<char> stk;
        for(int i=0; i<=s.size(); i++){
            if(s[i] == 'D'){
                stk.push(s[i]);
            }else{
                int j = i+1;
                while(!stk.empty()){
                     stk.pop();
                     res.push_back(j--);
                }
                res.push_back(j);
            }
        }
        return res;
    }
};

python3 解法, 执行用时: 80 ms, 内存消耗: 16.8 MB, 提交时间: 2023-10-22 10:53:45

class Solution:
    def findPermutation(self, s: str) -> List[int]:
        if not s: return [1]
        res, asc = [1], 0
        for i in range(len(s)):
            if s[i:i+1] == 'D':
                res.insert(asc, i + 2)
            else:
                res.append(i + 2)
                asc = i + 1
        return res