Commitaa5b8b8

committed

implement: 122

1 parent5e1a4b4 commitaa5b8b8Copy full SHA for aa5b8b8

File tree

+46

-1

lines changed

+46

-1

lines changed

Lines changed: 46 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -26,4 +26,49 @@ var maxProfit = function(prices) {`
`26`	`26`	`}`
`27`	`27`
`28`	`28`	`returnres;`
`29`		`-};`
	`29`	`+};`
	`30`	`+`
	`31`	`+/**`
	`32`	`+ * 一次遍历`
	`33`	`+ @param {} prices`
	`34`	`+ */`
	`35`	`+varmaxProfit=function(prices){`
	`36`	`+constlen=prices.length;`
	`37`	`+if(len<2)return0;`
	`38`	`+letres=0;`
	`39`	`+`
	`40`	`+for(leti=1;i<len;i++){`
	`41`	`+consttemp=prices[i]-prices[i-1];`
	`42`	`+if(temp>0){`
	`43`	`+res+=temp;`
	`44`	`+}`
	`45`	`+}`
	`46`	`+`
	`47`	`+returnres;`
	`48`	`+}`
	`49`	`+`
	`50`	`+/**`
	`51`	`+ * 找到每次单调进行处理`
	`52`	`+ @param {} prices`
	`53`	`+ */`
	`54`	`+varmaxProfit=function(prices){`
	`55`	`+constlen=prices.length;`
	`56`	`+if(len<2)return0;`
	`57`	`+letres=0;`
	`58`	`+letpeak=prices[0],valley=prices[0];`
	`59`	`+`
	`60`	`+leti=1;`
	`61`	`+while(i<len){`
	`62`	`+while(i<len&&prices[i]-prices[i-1]<=0){`
	`63`	`+i++;`
	`64`	`+}`
	`65`	`+valley=prices[i-1];`
	`66`	`+while(i<len&&prices[i]-prices[i-1]>=0){`
	`67`	`+i++;`
	`68`	`+}`
	`69`	`+peak=prices[i-1];`
	`70`	`+res+=peak-valley;`
	`71`	`+}`
	`72`	`+`
	`73`	`+returnres;`
	`74`	`+}`

Comments

(0)