Function explore2

longest_increasing_subsequence_300/solution.go:82–94

This approach is also slow (O(2^n) runtime. It works, but times out on leetcode. We can do better.

(nums []int, previousVal int, currentIdx int)

// It works, but times out on leetcode.
// We can do better.
func explore2(nums []int, previousVal int, currentIdx int) int {
	if currentIdx == len(nums) {
		return 0
	}

	max1 := 0
	if previousVal < nums[currentIdx] {
		max1 = 1 + explore2(nums, nums[currentIdx], currentIdx+1)
	}
	max2 := explore2(nums, previousVal, currentIdx+1)

	return int(math.Max(float64(max1), float64(max2)))
}

// This approach is slow (exponential runtime).
// It works, but times out on leetcode.