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

auto commit

Browse Source
This commit is contained in:
CyC2018 2019-05-15 00:04:04 +08:00
parent f5293e88a1
commit 2b3c0ae311
2 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -299,6 +299,8 @@ 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 数组累加的结果。
```java ```java
public int numberOfArithmeticSlices(int[] A) { public int numberOfArithmeticSlices(int[] A) {
if (A == null || A.length == 0) { if (A == null || A.length == 0) {

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

@ -299,6 +299,8 @@ 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 数组累加的结果。
```java ```java
public int numberOfArithmeticSlices(int[] A) { public int numberOfArithmeticSlices(int[] A) {
if (A == null || A.length == 0) { if (A == null || A.length == 0) {