sequence

Documentation

Index

• func CoinsWay1(arr []int, aim int) int
• func CoinsWay2(arr []int, aim int) int
• func CoinsWay3(arr []int, aim int) int
• func CoinsWay4(arr []int, aim int) int
• func CoinsWay5(arr []int, aim int) int
• func Cow1(n int) int
• func Cow2(n int) int
• func Cow3(n int) int
• func DungeonGame(m [][]int) (b int)
• func DungeonGame2(m [][]int) (b int)
• func Fibonacci1(n int) int
• func Fibonacci2(n int) int
• func Fibonacci3(n int) int
• func Hanoi(n int)
• func IsStrCross(str1, str2, aim string) bool
• func IsStrCross2(str1, str2, aim string) bool
• func MinCoins1(arr []int, aim int) (c int)
• func MinCoins2(arr []int, aim int) (c int)
• func MinCoins3(arr []int, aim int) (c int)
• func MinCoins4(arr []int, aim int) (c int)
• func MinEditCost(str1, str2 string, dc, rc, ic int) (c int)
• func MinEditCost2(str1, str2 string, dc, rc, ic int) (c int)
• func MinPathSum1(m [][]int) int
• func MinPathSum2(m [][]int) int
• func Steps1(n int) int
• func Steps2(n int) int
• func Steps3(n int) int

Functions

func CoinsWay1

func CoinsWay1(arr []int, aim int) int

arr中为正数且不重复，每个值代表一种货币，可使用任意张，求值为aim的换钱有多少种.

func CoinsWay2

func CoinsWay2(arr []int, aim int) int

func CoinsWay3

func CoinsWay3(arr []int, aim int) int

func CoinsWay4

func CoinsWay4(arr []int, aim int) int

func CoinsWay5

func CoinsWay5(arr []int, aim int) int

func Cow1

func Cow1(n int) int

c(n)=c(n-1)+c(n-3).

func Cow2

func Cow2(n int) int

func Cow3

func Cow3(n int) int

func DungeonGame

func DungeonGame(m [][]int) (b int)

龙与地下城游戏：左上角出发，只能向下或向右，每个值代表加血或减血，求到右下角至少剩1血量，骑士所需的初始血量.

func DungeonGame2

func DungeonGame2(m [][]int) (b int)

func Fibonacci1

func Fibonacci1(n int) int

func Fibonacci2

func Fibonacci2(n int) int

func Fibonacci3

func Fibonacci3(n int) int

斐波那契数列 f(n)=f(n-1)+f(n-2).

func Hanoi

func Hanoi(n int)

func IsStrCross

func IsStrCross(str1, str2, aim string) bool

判定aim是否顺序交错包含str1和str2.

func IsStrCross2

func IsStrCross2(str1, str2, aim string) bool

func MinCoins1

func MinCoins1(arr []int, aim int) (c int)

arr代表不重复的货币，可使用多次，求aim值得最小组合数.

func MinCoins2

func MinCoins2(arr []int, aim int) (c int)

func MinCoins3

func MinCoins3(arr []int, aim int) (c int)

arr代表可重复的货币，每张可使用1次，求aim值得最小组合数.

func MinCoins4

func MinCoins4(arr []int, aim int) (c int)

arr代表可重复的货币，每张可使用1次，求aim值得最小组合数.

func MinEditCost

func MinEditCost(str1, str2 string, dc, rc, ic int) (c int)

把str1变为str2需要的最小代价（dc：删除代价，rc：替换代价，ic：插入代价）.

func MinEditCost2

func MinEditCost2(str1, str2 string, dc, rc, ic int) (c int)

func MinPathSum1

func MinPathSum1(m [][]int) int

矩阵中向右或向下走，到达右下角的最短路径和.

func MinPathSum2

func MinPathSum2(m [][]int) int

func Steps1

func Steps1(n int) int

s(n)=s(n-1)+s(n-2).

func Steps2

func Steps2(n int) int

func Steps3

func Steps3(n int) int

矩阵.