Day53 1143.最长公共子序列1035.不相交的线53.最大子序和 动态规划

// 18 1143.最长公共子序列
package main

import "fmt"

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

	}
	return dp[len(text1)][len(text2)]
}
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}
func main() {
	text1 := "abcde"
	text2 := "ace"
	res := longestCommonSubsequence(text1, text2)
	fmt.Printf("res: %v\n", res) //res: 3
}

// 19 1035.不相交的线
package main

import "fmt"

func maxUncrossedLines(nums1 []int, nums2 []int) int {
	// 本质为最长公共子序列问题
	// dp[i][j]表示[0,i-1]长的nums1和[0,j-1]长的nums2的最大公共子序列的长度，全部元素初始化为0
	dp := make([][]int, len(nums1)+1)
	for i, _ := range dp {
		dp[i] = make([]int, len(nums2)+1)
	}
	//遍历顺序为从前到后从左往右
	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
			} else { //不要求连续
				dp[i][j] = max(dp[i-1][j], dp[i][j-1])
			}
		}
	}
	return dp[len(nums1)][len(nums2)]
}
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}
func main() {
	nums1 := []int{1, 4, 2}
	nums2 := []int{1, 2, 4}
	res := maxUncrossedLines(nums1, nums2)
	fmt.Printf("res: %v\n", res) //res: 2
}

// 20 53.最大子序和
package main

import "fmt"

func maxSubArray(nums []int) int {
	// dp[i]表示以nums[i]结尾的子数组的最大和
	dp := make([]int, len(nums))
	dp[0] = nums[0]
	res := dp[0]
	//遍历顺序为从左到右
	for i := 1; i < len(nums); i++ {
		dp[i] = max(dp[i-1]+nums[i], nums[i])
		if dp[i] > res {
			res = dp[i]
		}
	}
	return res
}
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}
func main() {
	nums := []int{-2, 1, -3, 4, -1, 2, 1, -5, 4}
	res := maxSubArray(nums)
	fmt.Printf("res: %v\n", res) //res: 6
}