修改文件: DynamicProgram/300-longest-increasing-subsequence.md

DragonFive · DragonFive · commit a622f4f21c25 · 2017-06-14T09:59:01.000+08:00
diff --git a/DynamicProgram/300-longest-increasing-subsequence.md b/DynamicProgram/300-longest-increasing-subsequence.md
@@ -22,7 +22,7 @@ grammar_cjkRuby: true
             for (int j = 0 ; j < i; j ++)
                 if (nums[i] > nums[j] && lens[j] > bigger)
                     bigger = lens[j];
-            lens[i] = bigger + 1;
+            lens[i] = bigger + 1;//这里设置的比较巧妙，当i是递增序列中的第一个元素的时候，依然是成立的
         }
         //找到lens数组中的最大值;
         int maxLen = 0;

Original file line number	Diff line number	Diff line change
`@@ -22,7 +22,7 @@ grammar_cjkRuby: true`
`22`	`22`	`for (int j = 0 ; j < i; j ++)`
`23`	`23`	`if (nums[i] > nums[j] && lens[j] > bigger)`
`24`	`24`	`bigger = lens[j];`
`25`		`- lens[i] = bigger + 1;`
	`25`	`+ lens[i] = bigger + 1;//这里设置的比较巧妙，当i是递增序列中的第一个元素的时候，依然是成立的`
`26`	`26`	`}`
`27`	`27`	`//找到lens数组中的最大值;`
`28`	`28`	`int maxLen = 0;`