Wonz
Wonz
全部文章
分类
# ACM(1)
# C++(32)
# C语言(12)
# Django(11)
# git(3)
# Hexo(6)
# HTML(1)
# LaTex学习(1)
# Linux(16)
# MySQL(1)
# PAT(46)
# Python(13)
# SQL数据库(10)
# 动态规划(13)
# 微型计算机原理与接口技术(16)
# 操作系统(9)
# 数据结构(28)
# 机器学习(4)
# 比赛感想与回忆(1)
# 汇编语言程序设计(11)
# 洛谷(4)
# 离散数学(5)
# 经验之谈(1)
# 编译原理(4)
# 计算机图形学(14)
# 资源汇总(5)
# 软件安装(34)
# 运筹学(5)
Go学习笔记(19)
LeetCode个人题解(179)
PostgreSQL(3)
——————数学——————(1)
——————科研——————(1)
——————算法——————(13)
——————随笔——————(12)
—————人工智能—————(1)
南邮期末考试回忆and知识梳理(1)
实用小工具分享(2)
找工作(1)
归档
标签
去牛客网
登录
/
注册
Wonz
Enjoy Coding. Enjoy Life.
TA的专栏
198篇文章
1人订阅
LeetCode个人题解
179篇文章
1595人学习
Go学习笔记
19篇文章
869人学习
全部文章
(共67篇)
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: [外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传...
二叉树
LeetCode
Python
2021-01-20
0
632
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...
二叉树
LeetCode
Python
2021-01-20
0
457
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...
二叉树
LeetCode
Python
2021-01-11
0
523
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...
二叉树
LeetCode
Python
2021-01-11
0
580
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: ...
二叉树
LeetCode
Python
2021-01-11
0
518
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: [...
二叉树
LeetCode
Python
2021-01-10
0
526
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 ...
二叉树
LeetCode
Python
2021-01-10
0
521
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...
二叉树
LeetCode
Python
2021-01-10
0
651
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 bina...
二叉树
LeetCode
Python
2021-01-07
0
492
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 ...
二叉树
Python
LeetCode
2021-01-07
0
551
首页
上一页
1
2
3
4
5
6
7
下一页
末页