beautymo - 簡(jiǎn)書(shū)

IP屬地：天津

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

152 0 0
[Leetcode]226. Invert Binary Tree
解釋?zhuān)壕褪前岩豢枚鏄?shù)的左子樹(shù)和右子樹(shù)不停交換，還是挺簡(jiǎn)單的，代碼如下：易錯(cuò)：此時(shí)那棵交換后的樹(shù)是這樣的：出現(xiàn)的問(wèn)題是1,3的雙親本來(lái)是2...

254 0 0

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

285 0 0
[Leetcode]112. Path Sum
問(wèn)題描述：Given a binary tree and a sum, determine if the tree has a root-to-...

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

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

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

324 0 0