(Golang)leetcode Hot100 动态规划

//70、爬楼梯
func climbStairs(n int) int {
	//dp[i]爬i阶楼梯的方法数
	//dp[i]=dp[i-1]+dp[i-2]
	dp := make([]int, n+1)
	dp[0], dp[1] = 1, 1
	for i := 2; i <= n; i++ {
		dp[i] = dp[i-1] + dp[i-2]
	}
	return dp[n]

}

//62、不同路径
func uniquePaths(m int, n int) int {
	dp := make([][]int, m+1)
	for i := 0; i < m+1; i++ {
		dp[i] = make([]int, n+1)
	}
	for i := 0; i < m+1; i++ {
		dp[i][0] = 1
	}
	for j := 0; j < n+1; j++ {
		dp[0][j] = 1
	}
	for i := 1; i <= m; i++ {
		for j := 1; j <= n; j++ {
			dp[i][j] = dp[i][j-1] + dp[i-1][j]
		}
	}
	return dp[m-1][n-1]
}

//118.杨辉三角
func generate(numRows int) [][]int {
	dp := make([][]int, numRows)
	for i := 0; i < numRows; i++ {
		dp[i] = make([]int, i+1)
	}
	for i := 0; i < numRows; i++ {
		dp[i][0] = 1
		dp[i][i] = 1
	}
	for i := 2; i < numRows; i++ {
		for j := 1; j < i; j++ {
			dp[i][j] = dp[i-1][j] + dp[i-1][j-1]
		}
	}
	return dp
}

//198、打家劫舍
func rob(nums []int) int {
	dp := make([]int, len(nums))
	dp[0] = nums[0]
	dp[1] = max(nums[0], nums[1])
	for i := 2; i < len(nums); i++ {
		dp[i] = max(dp[i-1], dp[i-2]+nums[i])
	}
	return dp[len(nums)-1]
}

//279、完全平方数
func numSquares(n int) int {
	//完全背包
	dp := make([]int, n+1)
	dp[0] = 0
	for i := 1; i < n+1; i++ {
		dp[i] = math.MaxInt32
	}
	for i := 1; i*i <= n; i++ {
		for j := i * i; j <= n; j++ {
			dp[j] = min(dp[j-i*i]+1, dp[j])
		}
	}
	return dp[n]

}

//322、零钱兑换
func coinChange(coins []int, amount int) int {
	//dp[j]表示凑成总金额最小的钱币数
	dp := make([]int, amount+1)
	//dp数组初始化
	dp[0] = 0
	for i := 1; i < len(dp); i++ {
		dp[i] = math.MaxInt32
	}
	//遍历顺序先遍历物品背包均可
	for i := 0; i < len(coins); i++ {
		for j := coins[i]; j <= amount; j++ {
			dp[j] = min(dp[j-coins[i]]+1, dp[j])
		}
	}
    if dp[amount]==math.MaxInt32{
        return -1
    }
	return dp[amount]
}

//139、单词拆分
func wordBreak(s string, wordDict []string) bool {
	hash := make(map[string]bool)
	for _, v := range wordDict {
		hash[v] = true
	}
	dp := make([]bool, len(s)+1)
	dp[0] = true
	for j := 1; j <= len(s); j++ { //排列问题，先背包
		for i := 0; i < j; i++ { //后物品
			if dp[i] == true && hash[s[i:j]] {
				dp[j] = true
			}
		}
	}
	return dp[len(s)]
}

//300、最长递增子序列
func lengthOfLIS(nums []int) int {
	dp := make([]int, len(nums))
	for i := 0; i < len(nums); i++ {
		dp[i] = 1
	}
	res := 1
	for i := 1; i < len(nums); i++ {
		for j := 0; j < i; j++ {
			if nums[j] < nums[i] {
				dp[i] = max(dp[j]+1, dp[i])
			}
		}
		res = max(res, dp[i])
	}
	return res
}

//152、乘积最大子数组
func maxProduct(nums []int) int {
	res, Max, Min := nums[0], nums[0], nums[0]
	for i := 1; i < len(nums); i++ {
		mx, mn := Max, Min
		Max = max(mx*nums[i], mn*nums[i], nums[i])
		Min = min(mx*nums[i], mn*nums[i], nums[i])
		res = max(res, Max)
	}
	return res
}

//416、分割等和子集
func canPartition(nums []int) bool {
	sum := 0
	for _, v := range nums {
		sum += v
	}
	if sum%2 == 1 {
		return false
	}
	dp := make([]int, (sum/2)+1)
	//0-1背包
	for i := 0; i < len(nums); i++ {
		for j := sum / 2; j >= nums[i]; j-- { //注意这里的等号
			dp[j] = max(dp[j-nums[i]]+nums[i], dp[j])
		}
	}
	return dp[sum/2] == sum/2
}

//5、最长回文子串
//中心扩散法
func longestPalindrome(s string) string {
	if len(s) == 0 {
		return s
	}
	start, end := 0, 0
	for i := 0; i < len(s); i++ {
		left1, right1 := expandAroundCenter(s, i, i)   //字符串长度为奇数
		left2, right2 := expandAroundCenter(s, i, i+1) //字符串长度为偶数

		if right1-left1 > end-start {
			start, end = left1, right1
		}
		if right2-left2 > end-start {
			start, end = left2, right2
		}
	}
	return s[start : end+1]
}
func expandAroundCenter(s string, left, right int) (int, int) {
	for left >= 0 && right < len(s) && s[left] == s[right] {
		left--
		right++
	}
	return left + 1, right - 1
}

 

//32、最长有效括号
func longestValidParentheses(s string) int {
	maxLen := 0
	left, right := 0, 0
	for i := 0; i < len(s); i++ {
		if s[i] == '(' {
			left++
		} else {
			right++
		}
		if left == right {
			maxLen = max(maxLen, left*2)
		} else if right > left {
			left, right = 0, 0
		}
	}
	left, right = 0, 0
	for i := len(s) - 1; i >= 0; i-- {
		if s[i] == ')' {
			right++
		} else {
			left++
		}
		if left == right {
			maxLen = max(maxLen, left*2)
		} else if left > right {
			left, right = 0, 0
		}
	}
	return maxLen

}

//1143、最长公共子序列
func longestCommonSubsequence(text1 string, text2 string) int {
	dp := make([][]int, len(text1)+1)
	for i, _ := range dp {
		dp[i] = make([]int, len(text2)+1)
	}
	//dp[i][j]表示以i-1和j-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)]
}

//72、编辑距离
func minDistance(word1 string, word2 string) int {
	//dp[i][j]表示word1以i-1结尾word2以j-1结尾转换所需的最小步数
	dp := make([][]int, len(word1)+1)
	for i, _ := range dp {
		dp[i] = make([]int, len(word2)+1)
	}
	//初始化 dp[0][j]=j,dp[i][0]=i
	for i := 0; i <= len(word1); i++ {
		dp[i][0] = i
	}
	for j := 0; j <= len(word2); j++ {
		dp[0][j] = j
	}
	//遍历顺序从左往右从上到下
	for i := 1; i <= len(word1); i++ {
		for j := 1; j <= len(word2); j++ {
			if word1[i-1] == word2[j-1] {
				dp[i][j] = dp[i-1][j-1] //不删除元素，不做任何操作
			} else {
				//删除word1元素或删除word2元素（删除和增加本质是一样的）或替换word1和word2元素
				dp[i][j] = min(dp[i-1][j]+1, dp[i][j-1]+1, dp[i-1][j-1]+1)
			}
		}
	}
	return dp[len(word1)][len(word2)]
}

//64、最小路径和
func minPathSum(grid [][]int) int {
	dp := make([][]int, len(grid))
	for i := 0; i < len(grid); i++ {
		dp[i] = make([]int, len(grid[0]))
	}
	dp[0][0] = grid[0][0]
	for i := 1; i < len(grid); i++ {
		dp[i][0] = dp[i-1][0] + grid[i][0]
	}
	for i := 1; i < len(grid[0]); i++ {
		dp[0][i] = dp[0][i-1] + grid[0][i]
	}

	for i := 1; i < len(grid); i++ {
		for j := 1; j < len(grid[0]); j++ {
			dp[i][j] = min(dp[i-1][j]+grid[i][j], dp[i][j-1]+grid[i][j])
		}
	}
	return dp[len(grid)-1][len(grid[0])-1]
}