Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 942 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 942 # by problem number
lcpy gen -s di_string_match # by problem name
perm of n + 1 integers of all the integers in the range [0, n] can be represented as a string s of length n where:
s[i] == 'I' if perm[i] < perm[i + 1], ands[i] == 'D' if perm[i] > perm[i + 1].s, reconstruct the permutation perm and return it. If there are multiple valid permutations perm, return any of them.
Input: s = "IDID"
Output: [0,4,1,3,2]
Explanation: [0,4,1,3,2] is one valid answer.
Input: s = "III"
Output: [0,1,2,3]
Input: s = "DDI"
Output: [3,2,0,1]
1 <= s.length <= 10^5s[i] is either 'I' or 'D'.class Solution:
# Time: O(n)
# Space: O(n) for the output
def di_string_match(self, s: str) -> list[int]:
low, high = 0, len(s)
perm: list[int] = []
for char in s:
if char == "I":
perm.append(low)
low += 1
else:
perm.append(high)
high -= 1
perm.append(low)
return perm
| Time | Space |
|---|---|
| O(n) | O(n) for the output |