1087. Brace Expansion #167
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Collaborator
|
Hello Erdem, In this case, we would be using a StringBuilder instead of a TreeNode in order to reconstruct the string. When we are available for that hypothetic solution, we can meditate on it as well. I approved this one. Thanks for your valuable effort and attention. |
altay9
approved these changes
May 5, 2021
Closed
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The main process of this algorithm is like this:
If we have some letters inside the braces, then the result is just of concatenation of these strings and "brace expansion" of the rest of the string.
The TreeSet is responsible for lexographically sorting these strings.
Additionally, there is also a possible solution with the list. This can also be added.
The credit for the code goes here.