贪心算法

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20

func maxProfit(p []int) int {
	ret := 0
	tmp := 0
	for i := 1; i < len(p); i++ {
		d := p[i] - p[i-1]
		if tmp+d < 0 {
			tmp = 0
		} else {
			tmp += d
			ret = max(ret, tmp)
		}
	}
	return ret
}
func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10

func maxProfit(p []int) int {
	ret := 0
	for i := 1; i < len(p); i++ {
		d := p[i] - p[i-1]
		if d > 0 {
			ret += d
		}
	}
	return ret
}