#面试刷题 · 小土刀 5.0

2016-01-13

Course Schedule II

There are a total of n courses you have to take, labeled from 0 to n - 1.

2016-01-13

There are a total of n courses you have to take, labeled from 0 to n - 1.

2016-01-13

有一些原木，现在想把这些木头切割成一些长度相同的小段木头，需要得到的小段的数目至少为 k。当然，我们希望得到的小段越长越好，你需要计算能够得到的小段木头的最大长度。

2016-01-13

Implement an algorithm to delete a node in the middle of a singly linked list, given only access to that node.

2016-01-13

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

2016-01-13

给出n，生成所有由1...n为节点组成的不同的二叉查找树

2016-01-13

给出 n，问由 1...n 为节点组成的不同的二叉查找树有多少种？

2016-01-13

Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.

2016-01-13

出处 Lowest Common Ancestor of a Binary Tree

2016-01-13

Given a binary tree, flatten it to a linked list in-place.