Golang Leetcode 581. Shortest Unsorted Continuous Subarray.go

func findUnsortedSubarray(nums []int) int {

	n := len(nums)
	begin, end := -1, -2
	min, max := nums[n-1], nums[0]
	for i := 0; i < n; i++ {
		max = mymax(max, nums[i])
		min = mymin(min, nums[n-1-i])
		if nums[i] < max {
			end = i
		}
		if nums[n-1-i] > min {
			begin = n - 1 - i
		}
	}
	return end - begin + 1
}

//使用自定义的max、min，速度会快很多
func mymin(x, y int) int {
	if x > y {
		return y
	}
	return x
}
func mymax(x, y int) int {
	if x > y {
		return x
	}
	return y
}