Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
28 lines (25 loc) · 824 Bytes

File metadata and controls

28 lines (25 loc) · 824 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
package leetcode._22_;
import java.util.ArrayList;
import java.util.List;
class Solution {
public List<String> generateParenthesis(int n) {
List<String> result = new ArrayList<>();
traceBack(result, "", n, n);
return result;
}
private void traceBack(List<String> result, String curStr, int left, int rigth) {
if (left == 0 && rigth == 0) {
result.add(curStr);
return;
}
if (left > rigth) { // 如果 剩余的 右括号比比左括号 少,说明 当前 str 的右括号多,无法匹配,不再递归
return;
}
if (left >= 0) {
traceBack(result, curStr + '(', left - 1, rigth);
}
if (rigth >= 0) {
traceBack(result, curStr + ')', left, rigth - 1);
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.