Leetcode 484. Find Permutation

Given a string of 'I' and 'D' of length n-1 that specifies whether each adjacent pair in a permutation of 1..n should be increasing or decreasing, construct the lexicographically smallest permutation that satisfies those relational constraints.