1 前言
【最简单易懂的】动态规划 - 括号生成 - 力扣(LeetCode)
1.1 解法-动态规划
dp[0] = "";
dp[1] ="()"
dp[2] = (dp[0]) + dp[1] ,(dp[1]) + dp[0] = [()(),(())].
dp[3] = (dp[0])+dp[2][1],(dp[0]) + dp[2][2], (dp[1])dp[1] , (dp[2][1]) + dp[0], (dp[2][2])+dp[0];
= [()()(),()(()),(())(),(()()),((()))]
迭代方程如下:
for (int i = 2; i < n + 1; i++) {
ArrayList<String> temp = new ArrayList<>();
for (int j = 0; j < i; j++) {
List<String> str1 = result.get(j);
List<String> str2 = result.get(i - j - 1);
for (String s1 : str1) {
for (String s2 : str2) {
String el = "(" + s1 + ")" + s2;
temp.add(el);
}
}
}
1.2 代码实现
package cn.msf.hot100;
import java.util.ArrayList;
import java.util.List;
/**
* @author : msf
* @date : 2022/12/11
* 括号生成
*/
public class GenerateParenthesis {
public static void main(String[] args) {
List<String> strings = new GenerateParenthesis().generateParenthesis(3);
System.out.println(strings);
}
public List<String> generateParenthesis(int n) {
if (n == 1) {
List<String> result = new ArrayList<>();
result.add("()");
return result;
}
List<List<String>> result = new ArrayList<>();
ArrayList<String> list0 = new ArrayList<>();
list0.add("");
result.add(list0);
ArrayList<String> list1 = new ArrayList<>();
list1.add("()");
result.add(list1);
for (int i = 2; i < n + 1; i++) {
ArrayList<String> temp = new ArrayList<>();
for (int j = 0; j < i; j++) {
List<String> str1 = result.get(j);
List<String> str2 = result.get(i - j - 1);
for (String s1 : str1) {
for (String s2 : str2) {
String el = "(" + s1 + ")" + s2;
temp.add(el);
}
}
}
result.add(temp);
}
return result.get(n);
}
}
上述代码执行结果如下: