01 2021 档案

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 阅读(90) 评论(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 阅读(207) 评论(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 阅读(64) 评论(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 阅读(97) 评论(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 阅读(122) 评论(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 阅读(177) 评论(0) 推荐(0)
我的 2020 年复盘
摘要：学习与工作 2020 年 6 月，我大学毕业，关于我的大学四年，都写在了这篇文章：我在南京邮电大学的四年。 2020 年 8 月，我开始工作，关于工作，都写在了这篇文章：工作近半年的一些个人感悟。 生活 2020 年开始工作之后，我重拾了记账这个习惯。现在花钱都有所记录，现在每个月存下来的钱越来越多 阅读全文
posted @ 2021-01-20 23:12 Wonz 阅读(122) 评论(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 阅读(135) 评论(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 阅读(170) 评论(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 阅读(105) 评论(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 阅读(87) 评论(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 阅读(179) 评论(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 阅读(154) 评论(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 阅读(88) 评论(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 阅读(75) 评论(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 阅读(131) 评论(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 阅读(101) 评论(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 阅读(130) 评论(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 阅读(132) 评论(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 阅读(94) 评论(0) 推荐(0)
LeetCode | 0538. 把二叉搜索树转换为累加树【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:08 Wonz 阅读(88) 评论(0) 推荐(0)
LeetCode | 0230. 二叉搜索树中第K小的元素【Python】
摘要：Problem LeetCode Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Example 1: Input: root = [3,1,4,null 阅读全文
posted @ 2021-01-07 20:54 Wonz 阅读(102) 评论(0) 推荐(0)
LeetCode | 0654. Maximum Binary Tree最大二叉树【Python】
摘要：Problem LeetCode Given an integer array with no duplicates. A maximum tree building on this array is defined as follow: The root is the maximum number 阅读全文
posted @ 2021-01-06 22:46 Wonz 阅读(192) 评论(0) 推荐(0)
LeetCode | 0114. 二叉树展开为链表【Python】【Go】
摘要：Problem LeetCode Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: 1 / \ 2 5 / \ \ 3 4 6 The flattened 阅读全文
posted @ 2021-01-06 21:39 Wonz 阅读(141) 评论(0) 推荐(0)
LeetCode 0116. 填充每个节点的下一个右侧节点指针【Python】【Go】
摘要：Problem LeetCode You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has th 阅读全文
posted @ 2021-01-06 21:05 Wonz 阅读(87) 评论(0) 推荐(0)