发简信
IP属地：重庆
-
2023-08-10 我的ideavim配置
" 显示当前模式set showmode" 打开行号set number" 设置命令历史记录条数set history=2000" 关闭兼容viset nocompatibl...
-
2023-07-17 结构与解构
1. 缘起 芒格在他的《穷查理宝典》中，曾经说到过（原话记不清了），人要多储备一些思维模型，这样能多角度看待问题。 好的思维模型有很多，例如，演绎思维、归纳思维、结构思维等等...
-
symmetric-tree
描述： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around i...
-
binary-tree-level-order-traversal
描述： Given a binary tree, return the level order traversal of its nodes' values. (ie, fr...
-
binary-tree-zigzag-level-order-traversal
描述： Given a binary tree, return the zigzag level order traversal of its nodes' values. ...
-
construct-binary-tree-from-inorder-and-postorder-traversal
描述： Given inorder and postorder traversal of a tree, construct the binary tree. Note:Yo...
-
binary-tree-level-order-traversal-ii
描述： Given a binary tree, return the bottom-up level order traversal of its nodes' value...
-
balanced-binary-tree
描述： Given a binary tree, determine if it is height-balanced. For this problem, a height...
-
balanced-binary-tree
描述： Given a binary tree, determine if it is height-balanced. For this problem, a height...
-
path-sum-ii
描述： Given a binary tree and a sum, find all root-to-leaf paths where each path's sum eq...
-
populating-next-right-pointers-in-each-node-ii
描述： Follow up for problem "Populating Next Right Pointers in Each Node". What if the gi...
-
populating-next-right-pointers-in-each-node
描述： Given a binary tree Populate each next pointer to point to its next right node. If ...
-
2018-12-11
参考： 链接：https://www.cnblogs.com/yuzhangcmu/p/4172855.htmlhttps://zxi.mytechroad.com/blog...
-
欢迎访问我的个人博客 www.rejoiceblog.com（简书已经限制每日发布文章上限）中文/英文图书 IT书籍 计算机书籍 图书 社科 文学等
-
sum-root-to-leaf-numbers
描述： Given a binary tree containing digits from0-9only, each root-to-leaf path could rep...
-
copy-list-with-random-pointer
title: copy-list-with-random-pointerdate: 2018-12-09 00:27:33categories: LeetCodetags:[...
