Commitb25a834

committed

refactor 122

1 parent414977f commitb25a834Copy full SHA for b25a834

File tree

-1

lines changed

-1

lines changed

Lines changed: 7 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -22,7 +22,13 @@ public int maxProfit(int[] prices) {`
`22`	`22`	`}`
`23`	`23`
`24`	`24`	`publicstaticclassSolution2 {`
`25`		`-//simple one pass approach: the above solution could be simplied as below`
	`25`	`+//simple one pass approach: the above solution could be simplified as below`
	`26`	`+`
	`27`	`+/**`
	`28`	`+ * Or this approach could be understood as:`
	`29`	`+ * We'll sell and buy on the same day as long as this day's stock price is higher than the previous day, a good example is this array: [1, 2, 3, 4, 5].`
	`30`	`+ * As this problem states that:"you can buy it then immediately sell it on the same day". Likewise, we can buy it back immediately as we sell it on the same day.`
	`31`	`+ */`
`26`	`32`	`publicintmaxProfit(int[]prices) {`
`27`	`33`	`intpro =0;`
`28`	`34`	`for (inti =0;i <prices.length -1;i++) {`

Comments

(0)