Special binary strings are binary strings with the following two properties:
Given a special string
S, a move consists of choosing two consecutive, non-empty, special substrings of
S, and swapping them. (Two strings are consecutive if the last character of the first string is exactly one index before the first character of the second string.)
At the end of any number of moves, what is the lexicographically largest resulting string possible?
Input: S = "11011000" Output: "11100100" Explanation: The strings "10" [occuring at S] and "1100" [at S] are swapped. This is the lexicographically largest string possible after some number of swaps.
Shas length at most
Sis guaranteed to be a special binary string as defined above.
- Valid Parenthesis String (Medium)
Hint 1Draw a line from (x, y) to (x+1, y+1) if we see a "1", else to (x+1, y-1). A special substring is just a line that starts and ends at the same y-coordinate, and that is the lowest y-coordinate reached. Call a mountain a special substring with no special prefixes - ie. only at the beginning and end is the lowest y-coordinate reached. If F is the answer function, and S has mountain decomposition M1,M2,M3,...,Mk, then the answer is: reverse_sorted(F(M1), F(M2), ..., F(Mk)). However, you'll also need to deal with the case that S is a mountain, such as 11011000 -> 11100100.
There is no documentation for this package.