Best Time to Buy and Sell Stock II Solutions in Go

Number 122

Difficulty Easy

Acceptance 57.1%

Other languages C++

Solutions

Go solution by halfrost/LeetCode-Go

package leetcode

func maxProfit122(prices []int) int {
	profit := 0
	for i := 0; i < len(prices)-1; i++ {
		if prices[i+1] > prices[i] {
			profit += prices[i+1] - prices[i]
		}
	}
	return profit
}

package leetcode

func maxProfit122(prices []int) int {
	profit := 0
	for i := 0; i < len(prices)-1; i++ {
		if prices[i+1] > prices[i] {
			profit += prices[i+1] - prices[i]
		}
	}
	return profit
}