先科普一下什么叫斐波那契數列，以下內容摘自百度百科： 斐波那契數列（Fibonacci sequence），又稱黃金分割數列、因意大利數學家列昂納多·斐波那契（Leonardoda Fibonacc ...

Given preorder and inorder traversal of a tree, construct the binary tree. You ...

Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a b ...

如題，谷歌兩輪背靠背電面。兩輪都是廢話不多說直奔coding，雖然第一輪的中國大哥還是花了一點點時間了解了一下我的背景、畢業時間、research方向。說好的research面呢？ 中國大哥出的題: ...

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), fin ...

Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For examp ...

You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...

Recursion: 返回的時候返回lca和depth，每個node如果有大於一個子節點的depth相同就返回這個node，如果有一個子節點depth更深就返回個子節點lca，這個 ...