Commita8b0f60

authored

Merge pull requestneetcode-gh#338 from shehanck/main

leetcode-309 solution in Java

2 parentsa992800 +5d8876f commita8b0f60Copy full SHA for a8b0f60

File tree

+29

-0

lines changed

+29

-0

lines changed

Lines changed: 29 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,29 @@`
	`1`	`+classSolution {`
	`2`	`+publicintmaxProfit(int[]prices) {`
	`3`	`+Map<String,Integer>cache =newHashMap<>();`
	`4`	`+returndfs(prices,cache,0,true);`
	`5`	`+ }`
	`6`	`+`
	`7`	`+publicintdfs(int[]prices,Map<String,Integer>cache,intindex,booleanbuying) {`
	`8`	`+if (index >=prices.length) {`
	`9`	`+return0;`
	`10`	`+ }`
	`11`	`+Stringkey =index+"-"+buying;`
	`12`	`+`
	`13`	`+if (cache.containsKey(key)) {`
	`14`	`+returncache.get(key);`
	`15`	`+ }`
	`16`	`+`
	`17`	`+intcooldown =dfs(prices,cache,index +1,buying);`
	`18`	`+intbuyOsell =Integer.MIN_VALUE;`
	`19`	`+`
	`20`	`+if (buying) {`
	`21`	`+buyOsell =dfs(prices,cache,index +1, !buying) -prices[index];`
	`22`	`+ }else {`
	`23`	`+buyOsell =dfs(prices,cache,index +2, !buying) +prices[index];`
	`24`	`+ }`
	`25`	`+`
	`26`	`+cache.put(key,Math.max(buyOsell,cooldown));`
	`27`	`+returncache.get(key);`
	`28`	`+ }`
	`29`	`+}`

Comments

(0)