Skip to content

Commit

Permalink
Update 子序列问题模板.md
Browse files Browse the repository at this point in the history
It is "int[][] dp = new int[n][n];", not "int[][] dp = new **dp**[n][n];"
  • Loading branch information
yanrs17 authored and labuladong committed Jun 22, 2020
1 parent 86a335b commit 0e67bd2
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions 动态规划系列/子序列问题模板.md
Original file line number Diff line number Diff line change
Expand Up @@ -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++) {
Expand Down Expand Up @@ -149,4 +149,4 @@ int longestPalindromeSubseq(string s) {
[下一篇:动态规划之博弈问题](../动态规划系列/动态规划之博弈问题.md)
[目录](../README.md#目录)
[目录](../README.md#目录)

0 comments on commit 0e67bd2

Please sign in to comment.