發(fā)簡(jiǎn)信
IP屬地：艾奧瓦州
-
Top down/Bottom up in Tree
下一個(gè)目標(biāo)是弄清楚：Top down和Bottom up 理解：Bottom up - 是指不到最下面的葉節(jié)點(diǎn)，不會(huì)return（觸底后反彈 -...
-
Binary Tree *Level* Order Traversal - 637. Average of Levels in Binary Tree
題目地址典型的BFS了，只需要在遍歷當(dāng)前層級(jí)的時(shí)候記錄下結(jié)點(diǎn)個(gè)數(shù)和值的累加和就好了。 注意new后面的具體數(shù)據(jù)類型：List<Double> =...
-
BFS and DFS for traversing a Tree最近刷關(guān)于Tree的題遇到了不少用BFS/DFS解決的問題，鑒于自己對(duì)概念一知半解，翻出之前一個(gè)朋友推薦過(guò)的文章學(xué)習(xí)一下。原文地址：https:...
-
雙端隊(duì)列Deque「轉(zhuǎn)」雙端隊(duì)列Deque「轉(zhuǎn)」 頭部尾部操作語(yǔ)句不同：https://zh.wikipedia.org/wiki/%E5%8F%8C%E7%AB%AF...
-
isValidBST & Balanced binary Tree
isValidBST public boolean isValidBST(TreeNode root) {return valid(root, ...
-
501. Find Mode in Binary Search Tree
題目Given a binary search tree (BST) with duplicates, find all the mode(s)...
-
CSV module in Python
https://docs.python.org/3/library/csv.html 這段代碼批量給.csv文件加上headers(thanks...
-
617. Merge Two Binary Trees
For Tree 3, its each node's val is the sum(TreeNode t1 + TreeNode t2) in...
-
pathSum - leetcode
pathSum 1 Given a binary tree and a sum, determine if the tree has a roo...