Golang | Leetcode Golang题解之第403题青蛙过河

题目：

题解：

func canCross(stones []int) bool {n := len(stones)dp := make([][]bool, n)for i := range dp {dp[i] = make([]bool, n)}dp[0][0] = truefor i := 1; i < n; i++ {if stones[i]-stones[i-1] > i {return false}}for i := 1; i < n; i++ {for j := i - 1; j >= 0; j-- {k := stones[i] - stones[j]if k > j+1 {break}dp[i][k] = dp[j][k-1] || dp[j][k] || dp[j][k+1]if i == n-1 && dp[i][k] {return true}}}return false
}