beautymo - 簡書

IP屬地：天津

[Leetcode]64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from to...

141 0 0
[Leetcode]226. Invert Binary Tree
解釋：就是把一棵二叉樹的左子樹和右子樹不停交換，還是挺簡單的，代碼如下：易錯：此時那棵交換后的樹是這樣的：出現(xiàn)的問題是1,3的雙親本來是2...

252 0 0

[Leetcode]107. Binary Tree Level Order Traversal II
用隊列實現(xiàn)樹的廣度優(yōu)先搜索題目如下：實現(xiàn)代碼如下：以前一直寫的深度優(yōu)先，感覺這個還是蠻新鮮的，作為c++萌新菜拓，也學(xué)了一些c++中queue...

283 0 0
[Leetcode]112. Path Sum
問題描述：Given a binary tree and a sum, determine if the tree has a root-to-...

225 0 0
[Leetcode]110. Balanced Binary Tree
題目：Given a binary tree, determine if it is height-balanced. For this pro...

180 0 0
[Leetcode]111. Minimum Depth of Binary Tree
題目描述：Given a binary tree, find its minimum depth. The minimum depth is t...

155 0 0
順序表簡單實現(xiàn)
考研數(shù)據(jù)結(jié)構(gòu)得用c或c++寫，寫java的我終于還是被拉回來開始艱難而又咸魚的c++學(xué)習(xí),寫的可能不是很好，湊合看看吧注：若函數(shù)形參中用的是...

313 0 0