Day52 300.最长递增子序列 674.最长连续递增序列 718.最长重复子数组

//15 300.最长递增子序列
package main

import "fmt"

func lengthOfLIS(nums []int) int {
	// dp[i]表示以nums[i]结尾的最长递增子序列的长度
	dp := make([]int, len(nums))
	// dp[i]初始化为1
	for i, _ := range dp {
		dp[i] = 1
	}
	res := dp[0]
	//遍历顺序为i,j均为从小到大
	for i := 1; i < len(nums); i++ {
		for j := 0; j < i; j++ {
			if nums[i] > nums[j] {
				dp[i] = max(dp[j]+1, dp[i])
			}
		}
		if dp[i] > res { //记录dp数组中最大的值
			res = dp[i]
		}
		fmt.Printf("dp[%v]: %v\n", i, dp[i])
	}

	return res
}
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}
func main() {
	nums := []int{10, 9, 2, 5, 3, 7, 101, 18}
	res := lengthOfLIS(nums)
	fmt.Printf("res: %v\n", res)

}

// 16 674.最长连续递增序列
package main

import "fmt"

func findLengthOfLCIS(nums []int) int {
	// dp[i]表示以nums[i]为结尾的最长连续子序列的长度
	dp := make([]int, len(nums))
	//初始化dp数组为1
	for i, _ := range dp {
		dp[i] = 1
	}
	res := dp[0]
	//遍历顺序为从前到后
	for i := 1; i < len(nums); i++ {
		if nums[i-1] < nums[i] {
			dp[i] = dp[i-1] + 1
		}
		if dp[i] > res { //记录dp数组的最大值
			res = dp[i]
		}
	}
	return res
}
func main() {
	nums := []int{1, 3, 5, 4, 7}
	res := findLengthOfLCIS(nums)
	fmt.Printf("res: %v\n", res) //res: 3
}

// 17 718.最长重复子数组
package main

import "fmt"

func findLength(nums1 []int, nums2 []int) int {
	// dp[i][j]表示text1以i-1和text2以j-1结尾的最长公共子序列,dp[i][0],dp[0][j]为0，其余也为0
	dp := make([][]int, len(nums1)+1)
	for i, _ := range dp {
		dp[i] = make([]int, len(nums2)+1)
	}
	res := dp[0][0]
	//遍历顺序为从前往后
	for i := 1; i <= len(nums1); i++ {
		for j := 1; j <= len(nums2); j++ {
			if nums1[i-1] == nums2[j-1] {
				dp[i][j] = dp[i-1][j-1] + 1
			}
			if dp[i][j] > res {
				res = dp[i][j]
			}
		}

	}
	return res
}
func main() {
	nums1 := []int{1, 2, 3, 2, 1}
	nums2 := []int{3, 2, 1, 4, 7}
	res := findLength(nums1, nums2)
	fmt.Printf("res: %v\n", res) //res: 3

}