Day57 Golang (动态规划) 647.回文子串 516.最长回文子序列

// 25 647.回文子串
package main

import "fmt"

func countSubstrings(s string) int {
	//dp[i][j]表示[i,j]是否是回文子串
	dp := make([][]bool, len(s))
	for i := 0; i < len(s); i++ {
		dp[i] = make([]bool, len(s))
	}
	res := 0
	//遍历顺序是i从后往前，j从左往右
	for i := len(s) - 1; i >= 0; i-- {
		for j := i; j < len(s); j++ {
			if s[i] == s[j] {
				if j-i <= 1 { //情况1：i=j 情况2：j和i只相差1
					dp[i][j] = true
					res++
				} else if dp[i+1][j-1] { //dp[i+1][j-1]== true
					dp[i][j] = true
					res++
				}
			}
		}
	}
	return res

}
func main() {
	s := "aaa"
	res := countSubstrings(s)
	fmt.Printf("res: %v\n", res) //res: 6
}

// 26 516.最长回文子序列
package main

import "fmt"

func longestPalindromeSubseq(s string) int {
	//dp[i][j]表示[i,j]范围内的最长回文子序列的长度
	dp := make([][]int, len(s))
	for i := 0; i < len(s); i++ {
		dp[i] = make([]int, len(s))
	}
	//dp[i][i]=1,i=j时初始化为1，其余为0
	for i := 0; i < len(s); i++ {
		dp[i][i] = 1
	}
	//遍历顺序是i从后往前，j从左往右
	for i := len(s) - 1; i >= 0; i-- {
		for j := i + 1; j < len(s); j++ {
			if s[i] == s[j] {
				dp[i][j] = dp[i+1][j-1] + 2
			} else {
				dp[i][j] = max(dp[i][j-1], dp[i+1][j])
			}
		}
	}
	return dp[0][len(s)-1]
}
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}
func main() {
	s := "bbbab"
	res := longestPalindromeSubseq(s)
	fmt.Printf("res: %v\n", res) //res: 4
}