IP屬地:德克薩斯州
9-1 number-of-islands (medium)必須是vertical或者h(yuǎn)orizontal的“1”才是連成一個島,這里用dfs進(jìn)...
Hoista variable can be used before it has been declared(var的定義方式).var沒有b...
6.5 fibonacci-number (easy)最基礎(chǔ)的算斐波那契數(shù)列。遞歸可以络它,或者是最簡單的動態(tài)規(guī)劃。這里的優(yōu)化就是空間復(fù)雜度從O(n...
5.6 symmetric-tree (easy)看一個樹是否鏡面對稱硬鞍,第一直覺是bfs,但還是用的遞歸和stack或者dequeue戴已,也就是說...
4.11.leaf-similar-trees (easy)所謂的leaf similar就是說固该,二叉樹的末端的node,從左到右的序列是一樣的...
3.11 two-sum (easy)Q: Given exactly one solution, -> 1 there still can b...