CCNWY

分类

题解(5)

/ 注册

全部文章（共83篇）

题解 | #字母收集#

package main import ( "fmt" "strings" ) func solution(arr [][]int) int { for r := 0; r < len(arr); r++ { for c := 0; c < len(arr[0]); c++...

2023-02-02

0 276

题解 | #打家劫舍(二)#

package main import "fmt" func _rob(arr []int) int { dp := make([]int, len(arr)) dp[0] = arr[0] //相当于最前面还有一个房子价值=0 dp[1] = max(arr[0], arr[1]+0)...

2022-12-02

0 347

题解 | #最长回文子序列#

package main import "fmt" func solution(str string) int { dp := make([][]int, len(str)) for i := range dp { dp[i] = make([]int, len(str)) } fo...

2022-12-01

0 267

题解 | #计算字符串的编辑距离#

package main import "fmt" func solution(str1, str2 string) int { dp := make([][]int, len(str1)+1) for i := range dp { dp[i] = make([]int, len(st...

2022-11-29

0 309

题解 | #跳台阶扩展问题#

package main import ( "fmt" "math" ) /** 根据题目得到递推公式：f(n) = f(n-1) + f(n-2) + ... + f(1) 那么，f(n-1) = f(n-2) + ... + f(1)，所以可以得到递推公式为：f(n) = 2...

2022-11-26

0 233

题解 | #最长公共子序列(一)#

package main import "fmt" func solution(str1, str2 string) int { dp := make([][]int, len(str1)+1) for i := range dp { dp[i] = make([]int, len(st...

2022-11-26

0 280

题解 | #滑雪#

package main import ( "bufio" "fmt" "os" "strconv" "strings" ) var arr [][]int var dp [][]int func solution(arr [][]int) int { dp = make([][]...

2022-11-26

0 288

题解 | #信封嵌套#

package main import ( "bufio" "fmt" "os" "sort" "strconv" "strings" ) /* * 二维数组排序 */ func solution(envelopes [][]int) int { if len(envelopes)...

2022-11-25

0 264

题解 | #拦截导弹#

package main import ( "bufio" "fmt" "os" "strconv" "strings" ) /* * 本质： 1、求解最长的递减子列长度（非严格递减，即：可以包含=） 2、Dilworth定理：最少的下降序列个数就等于整个序列最长上升子序列的长度（严格...

2022-11-23

0 291

题解 | #矩阵的最小路径和#

package main import ( "bufio" "fmt" "os" "strconv" "strings" ) func minSumPathDp(tables [][]int) int { dp := make([][]int, len(tables)) fo...

2022-11-21

0 268