Commit 1a75abd

authored

Merge pull request youngyangyang04#2126 from Lozakaka/patch-18

提供JAVA的2*2數組版本

2 parents 8bd216b + 4fab08d commit 1a75abdCopy full SHA for 1a75abd

File tree

+24

-1

lines changed

+24

-1

lines changed

Lines changed: 24 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -243,8 +243,27 @@ class Solution {`
`243`	`243`	`}`
`244`	`244`	`}`
`245`	`245`	```
	`246`	`+> 动态规划:版本二(使用二維數組(和卡哥思路一致),下面還有使用一維滾動數組的更優化版本)`
`246`	`247`
`247`		`-> 动态规划:版本二`
	`248`	+```Java
	`249`	`+class Solution {`
	`250`	`+ public int maxProfit(int[] prices) {`
	`251`	`+ int len = prices.length;`
	`252`	`+ int dp[][] = new int[2][2];`
	`253`	`+`
	`254`	`+ dp[0][0] = - prices[0];`
	`255`	`+ dp[0][1] = 0;`
	`256`	`+`
	`257`	`+ for (int i = 1; i < len; i++){`
	`258`	`+ dp[i % 2][0] = Math.max(dp[(i - 1) % 2][0], - prices[i]);`
	`259`	`+ dp[i % 2][1] = Math.max(dp[(i - 1) % 2][1], prices[i] + dp[(i - 1) % 2][0]);`
	`260`	`+ }`
	`261`	`+ return dp[(len - 1) % 2][1];`
	`262`	`+ }`
	`263`	`+}`
	`264`	+```
	`265`	`+`
	`266`	`+> 动态规划:版本二(使用一維數組)`
`248`	`267`
`249`	`268`	``` java
`250`	`269`	`class Solution {`
`@@ -271,6 +290,10 @@ class Solution {`
`271`	`290`	`}`
`272`	`291`	`}`
`273`	`292`	```
	`293`	+```Java
	`294`	`+`
	`295`	+```
	`296`	`+`
`274`	`297`
`275`	`298`	`Python:`
`276`	`299`

Comments

(0)