Backups/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update Leetcode 题解 - 动态规划.md

Browse Source 
勘误
This commit is contained in:
陈洪州 2019-05-30 11:52:31 +08:00 committed by GitHub
parent 79c83e70e4
commit bada236d6c
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
docs/notes/Leetcode 题解 - 动态规划.md
View File

@ -299,7 +299,7 @@ dp[4] = dp[3] + 1 = 3
综上，在 A[i] - A[i-1] == A[i-1] - A[i-2] 时，dp[i] = dp[i-1] + 1。 综上，在 A[i] - A[i-1] == A[i-1] - A[i-2] 时，dp[i] = dp[i-1] + 1。
因为递增子区间不一定以最一个元素为结尾，可以是任意一个元素结尾，因此需要返回 dp 数组累加的结果。 因为递增子区间不一定以最后一个元素为结尾，可以是任意一个元素结尾，因此需要返回 dp 数组累加的结果。
```java ```java
public int numberOfArithmeticSlices(int[] A) { public int numberOfArithmeticSlices(int[] A) {