张小小帅

分类

题解(43)

/ 注册

全部文章（共43篇）

题解 | #大数加法#

package main import "strconv" func solve( s string , t string ) string { tmp, n, m := 0, len(s)-1, len(t)-1 result := "" for n >...

Go 字符串

2021-10-31

2 388

题解 | #最大数#

package main import ( "fmt" "sort" "strings" ) func solve( nums []int ) string { // write code here n := len(nums) strs := make([]stri...

Go

2021-10-26

0 421

题解 | #最长回文子串#

package main func getLongestPalindrome( A string , n int ) int { start, end := 0, 0 for i := range A { l, r := expand(A, i, i) ...

Go

2021-10-16

0 491

题解 | #买卖股票的最好时机#

package main func maxProfit( prices []int ) int { if len(prices) <= 1 { return 0 } n := len(prices) dp := make([][2]i...

Go 动态规划

2021-10-16

1 325

题解 | #斐波那契数列#

package main //动态规划,时间On func Fibonacci( n int ) int { if n <= 1 { ...

Go 动态规划

2021-10-16

0 369

题解 | #最长公共子串#

package main func LCS( str1 string , str2 string ) string { // write code here m, n := len(str1), len(str2) res, end := 0, 0 dp := m...

Go 动态规划 LCS

2021-10-14

0 384

题解 | #连续子数组的最大和#

//动态规划，最大子序和，时空都是On package main func FindGreatestSumOfSubArray( array []int ) int { if len(array) == 0 { return 0 } n := le...

Go 动态规划

2021-10-14

0 330

题解 | #二叉树根节点到叶子节点的所有路径和#

package main import . "nc_tools" func sumNumbers( root *TreeNode ) int { // write code here return dfs(root, 0) } func dfs(root *...

Go

2021-09-22

0 384

题解 | #二叉树的最大路径和#

package main import "math" import . "nc_tools" func maxPathSum( root *TreeNode ) int { maxSum := math.MinInt32 var dfs f...

Go

2021-09-22

1 594

题解 | #二叉树中是否存在节点和为指定值的路径#

package main import . "nc_tools" func hasPathSum( root *TreeNode , sum int ) bool { // write code here if root == nil { r...

Go 递归

2021-09-22

1 372