Conversation
hroc135
reviewed
Jul 7, 2025
| all_parentheses = [] | ||
|
|
||
| def backtrack(parentheses, opening, closing): | ||
| if len(parentheses) == 2 * n: |
There was a problem hiding this comment.
下の二つの条件式に合わせて、'if opening == n and closing == n' のように opening, closing を使って判定してもいいですね。
|
|
||
| ### step3 | ||
|
|
||
| * TODO: もうちょっと他の人の回答を読み込みたいが、時間切れ。。一旦 review 出します。 |
There was a problem hiding this comment.
olsen-blue/Arai60#54 (comment)
自分はこの解法に感動したので共有です。
ryosuketc
added
the
need re-review
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
22. Generate Parentheses
https://leetcode.com/problems/generate-parentheses/