Commit13cd026

committed

121 (3) add README

1 parent273ed68 commit13cd026Copy full SHA for 13cd026

File tree

+16

-6

lines changed

+16

-6

lines changed

Lines changed: 12 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,12 @@`
	`1`	`+####[121] Best to Buy and Sell Stock`
	`2`	`+`
	`3`	`+0. Brutal Force: O(N^2) solution`
	`4`	`+`
	`5`	+```plain
	`6`	`+ For each stock price, // -> O(M)`
	`7`	`+ we want to find the lowest price beforehands. // O(N)`
	`8`	+ ```
	`9`	`+`
	`10`	`+1. O(N) solution`
	`11`	`+`
	`12`	`+ Save the lowest price before`

Lines changed: 4 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -22,17 +22,15 @@`
`22`	`22`	`publicclassSolution {`
`23`	`23`
`24`	`24`	`publicintmaxProfit(int[]prices) {`
`25`		`-intresult =0;`
	`25`	`+intresult =0;`
	`26`	`+// lowest price so far`
`26`	`27`	`intminPrice =Integer.MAX_VALUE;`
`27`	`28`	`for (intprice :prices) {`
`28`		`-// sell stock at current price`
`29`		`-// find the minimum price before this way`
`30`		`-minPrice =Math.min(minPrice,price);`
`31`	`29`
`32`		`-// profit = minPrice < price ? (price - minPrice) : 0;`
`33`		`-// profit = Math.max(price - minPrice, 0);`
	`30`	`+minPrice =Math.min(minPrice,price);`
`34`	`31`
`35`	`32`	`result =Math.max(result,price -minPrice);`
	`33`	`+`
`36`	`34`	`}`
`37`	`35`	`returnresult;`
`38`	`36`	`}`

Comments

(0)