mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2026-02-02 18:39:09 +08:00
更新图床
This commit is contained in:
@@ -82,7 +82,8 @@ for (int i = 1; i < nums.size(); i++) {
|
||||
|
||||
已输入nums = [1,3,5,4,7]为例,dp数组状态如下:
|
||||
|
||||

|
||||
|
||||

|
||||
|
||||
**注意这里要取dp[i]里的最大值,所以dp[2]才是结果!**
|
||||
|
||||
|
||||
Reference in New Issue
Block a user