Update 子序列问题模板.md

yanrs17 · labuladong · commit 0e67bd22467f · 2020-06-22T10:10:50.000+08:00
It is "int[][] dp = new int[n][n];", not "int[][] dp = new **dp**[n][n];"
diff --git a/动态规划系列/子序列问题模板.md b/动态规划系列/子序列问题模板.md
@@ -37,7 +37,7 @@ for (int i = 1; i < n; i++) {
 
 ```java
 int n = arr.length;
-int[][] dp = new dp[n][n];
+int[][] dp = new int[n][n];
 
 for (int i = 0; i < n; i++) {
     for (int j = 0; j < n; j++) {
@@ -149,4 +149,4 @@ int longestPalindromeSubseq(string s) {
 
 [下一篇：动态规划之博弈问题](../动态规划系列/动态规划之博弈问题.md)
 
-[目录](../README.md#目录)
+[目录](../README.md#目录)
