摘要: https://leetcode-cn.com/problems/er-cha-sou-suo-shu-de-hou-xu-bian-li-xu-lie-lcof/ 阅读全文
posted @ 2022-04-29 23:53 papering 阅读(30) 评论(0) 推荐(0)
摘要: https://leetcode-cn.com/problems/shu-zhi-de-zheng-shu-ci-fang-lcof/ func myPow(x float64, n int) float64 { var R func(x float64, m int) float64 R = fu 阅读全文
posted @ 2022-04-29 23:50 papering 阅读(30) 评论(0) 推荐(0)
摘要: https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof/ 剑指 Offer 07. 重建二叉树 输入某二叉树的前序遍历和中序遍历的结果,请构建该二叉树并返回其根节点。 假设输入的前序遍历和中序遍历的结果中都不含重复的数字。 示例 1: 阅读全文
posted @ 2022-04-29 23:23 papering 阅读(42) 评论(0) 推荐(0)