n + 1 integers of all the integers in the range
[0, n] can be represented as a string
s of length
s[i] == 'I'if
perm[i] < perm[i + 1], and
s[i] == 'D'if
perm[i] > perm[i + 1].
Given a string
s, reconstruct the permutation
perm and return it. If there are multiple valid permutations perm, return any of them.
Input: s = "IDID"
Input: s = "III"
Input: s = "DDI"
1 <= s.length <= 105
root of an n-ary tree, return the postorder traversal of its nodes' values.
Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)
Input: root = [1,null,3,2,4,null,5,6]
Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
- The number of nodes in the tree is in the range
0 <= Node.val <= 104
- The height of the n-ary tree is less than or equal to