随笔分类 -  LeetCode

上一页 1 2 3 4 5 6 ··· 9 下一页
LeetCode | 0606. 根据二叉树创建字符串【Python】
摘要：问题 力扣 你需要采用前序遍历的方式，将一个二叉树转换成一个由括号和整数组成的字符串。 空节点则用一对空括号 "()" 表示。而且你需要省略所有不影响字符串与原始二叉树之间的一对一映射关系的空括号对。 示例 1: 输入: 二叉树: [1,2,3,4] 1 / \ 2 3 / 4 输出: "1(2(4 阅读全文
posted @ 2021-02-24 21:04 Wonz 阅读(185) 评论(0) 推荐(0)
LeetCode | 0590. N叉树的后序遍历【Python】
摘要：Problem LeetCode Given an n-ary tree, return the postorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level 阅读全文
posted @ 2021-01-25 21:23 Wonz 阅读(89) 评论(0) 推荐(0)
LeetCode | 0589. N叉树的前序遍历【Python】
摘要：Problem LeetCode Given an n-ary tree, return the preorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level 阅读全文
posted @ 2021-01-25 21:14 Wonz 阅读(203) 评论(0) 推荐(0)
LeetCode | 0563. 二叉树的坡度【Python】
摘要：Problem LeetCode Given the root of a binary tree, return the sum of every tree node's tilt. The tilt of a tree node is the absolute difference between 阅读全文
posted @ 2021-01-23 18:32 Wonz 阅读(57) 评论(0) 推荐(0)
LeetCode | 0563. 二叉树的坡度【Python】
摘要：Problem LeetCode Given the root of a binary tree, return the sum of every tree node's tilt. The tilt of a tree node is the absolute difference between 阅读全文
posted @ 2021-01-23 18:27 Wonz 阅读(94) 评论(0) 推荐(0)
LeetCode | 0559. N 叉树的最大深度【Python】
摘要：Problem LeetCode Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down t 阅读全文
posted @ 2021-01-23 18:16 Wonz 阅读(121) 评论(0) 推荐(0)
LeetCode | 0783. 二叉搜索树节点最小距离【Python】
摘要：Problem LeetCode Given a Binary Search Tree (BST) with the root node root, return the minimum difference between the values of any two different nodes 阅读全文
posted @ 2021-01-21 21:32 Wonz 阅读(171) 评论(0) 推荐(0)
LeetCode | 0530. 二叉搜索树的最小绝对差【Python】
摘要：Problem LeetCode Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: I 阅读全文
posted @ 2021-01-20 22:43 Wonz 阅读(134) 评论(0) 推荐(0)
LeetCode | 0515. 在每个树行中找最大值【Python】
摘要：Problem LeetCode Given the root of a binary tree, return an array of the largest value in each row of the tree (0-indexed). Example 1: Input: root = [ 阅读全文
posted @ 2021-01-20 22:36 Wonz 阅读(166) 评论(0) 推荐(0)
LeetCode | 0513. 找树左下角的值【Python】
摘要：Problem LeetCode Given the root of a binary tree, return the leftmost value in the last row of the tree. Example 1: [外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传 阅读全文
posted @ 2021-01-20 22:27 Wonz 阅读(104) 评论(0) 推荐(0)
LeetCode | 0508. 出现次数最多的子树元素和【Python】
摘要：Problem LeetCode Given the root of a tree, you are asked to find the most frequent subtree sum. The subtree sum of a node is defined as the sum of all 阅读全文
posted @ 2021-01-20 22:12 Wonz 阅读(85) 评论(0) 推荐(0)
LeetCode | 0429. N 叉树的层序遍历【Python】
摘要：Problem LeetCode Given an n-ary tree, return the level order traversal of its nodes' values. Nary-Tree input serialization is represented in their lev 阅读全文
posted @ 2021-01-11 21:45 Wonz 阅读(175) 评论(0) 推荐(0)
LeetCode | 0235. 二叉搜索树的最近公共祖先【Python】
摘要：Problem LeetCode Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of 阅读全文
posted @ 2021-01-11 21:36 Wonz 阅读(151) 评论(0) 推荐(0)
LeetCode | 0145. 二叉树的后序遍历【Python】
摘要：Problem LeetCode Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [ 阅读全文
posted @ 2021-01-11 21:22 Wonz 阅读(83) 评论(0) 推荐(0)
LeetCode | 0145. 二叉树的后序遍历【Python】
摘要：Problem LeetCode Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [ 阅读全文
posted @ 2021-01-11 21:20 Wonz 阅读(71) 评论(0) 推荐(0)
LeetCode | 0144. 二叉树的前序遍历【Python】
摘要：Problem LeetCode Given the root of a binary tree, return the preorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1 阅读全文
posted @ 2021-01-10 21:46 Wonz 阅读(126) 评论(0) 推荐(0)
LeetCode | 0129. 求根到叶子节点数字之和【Python】
摘要：Problem LeetCode Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf 阅读全文
posted @ 2021-01-10 21:34 Wonz 阅读(98) 评论(0) 推荐(0)
LeetCode | 0103. 二叉树的锯齿形层序遍历【Python】
摘要：Problem LeetCode Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for th 阅读全文
posted @ 2021-01-10 21:24 Wonz 阅读(128) 评论(0) 推荐(0)
LeetCode | 0222. 完全二叉树的节点个数【Python】
摘要：Problem LeetCode Given a complete binary tree, count the number of nodes. Note: Definition of a complete binary tree from Wikipedia: In a complete bin 阅读全文
posted @ 2021-01-07 22:59 Wonz 阅读(130) 评论(0) 推荐(0)
LeetCode | 1038. 把二叉搜索树转换为累加树【Python】
摘要：Problem LeetCode Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the 阅读全文
posted @ 2021-01-07 21:23 Wonz 阅读(90) 评论(0) 推荐(0)

上一页 1 2 3 4 5 6 ··· 9 下一页