Range Addition II Solutions in Go

Number 598

Difficulty Easy

Acceptance 49.6%

Other languages C++

Solutions

Go solution by halfrost/LeetCode-Go

package leetcode

func maxCount(m int, n int, ops [][]int) int {
	minM, minN := m, n
	for _, op := range ops {
		minM = min(minM, op[0])
		minN = min(minN, op[1])
	}
	return minM * minN
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

package leetcode

func maxCount(m int, n int, ops [][]int) int {
	minM, minN := m, n
	for _, op := range ops {
		minM = min(minM, op[0])
		minN = min(minN, op[1])
	}
	return minM * minN
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}