public class Solution { public List<String> validParentheses(int l, int m, int n) { // Write your solution here int targetLen = (l + m + n) * 2; StringBuilder curr = new StringBuilder(); List<String> res = new ArrayList<&g.
摘要由CSDN通过智能技术生成
public class Solution {
public List<String> validParentheses(int l, int m, int n) {
// Write your solution here
int targetLen = (l + m + n) * 2;
StringBuilder curr = new StringBuilder();
List<String> res = new ArrayList<>();
Deque<Character> stack = new LinkedList<>();
char[] ps = new char[] {'(', ')', '<', '>', '{', '}'};
int[] remain = new int[] {l, l, m, m, n, n};
helper(ps, remain, targetLen, stack, curr, res);
return res;
}
private void helper(char[] ps, int[] remain, int targetLen, Deque<Character> stack, StringBuilder curr, List<String> res){
if(curr.length() == targetLen){
res.add(curr.toString());
return;
}
for(int i = 0; i < ps.length; i++){
// Pick up a left parenthesis
if(i % 2 == 0){
if(remain[i] >
LaiCode 179. All Valid Permutations Of Parentheses II
public class Solution { public List<String> validParentheses(int l, int m, int n) { // Write your solution here int targetLen = (l + m + n) * 2; StringBuilder curr = new StringBuilder(); List<String> res = new ArrayList<&g.
public class Solution { public List<String> validParentheses(int l, int m, int n) { // Write your solution here int targetLen = (l + m + n) * 2; StringBuilder curr = new StringBuilder(); List<String> res = new ArrayList<&g.
最低0.47元/天 解锁文章
107
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
