摘要:
Sort a linked list using insertion sort. Example Given 1->3->2->0->null, return 0->1->2->3->null. 思路也比较直接,insertion sort,要注意的就是操作linkedlist的一些问题 /** * 阅读全文
摘要:
Given a binary search tree and a new tree node, insert the node into the tree. You should keep the tree still be a valid binary search tree. Example G 阅读全文
摘要:
Given a non-overlapping interval list which is sorted by start point. Insert a new interval into it, make sure the list is still in order and non-over 阅读全文
摘要:
Check if two binary trees are identical. Identical means the two binary trees have the same structure and every identical position has the same value. 阅读全文
摘要:
In data structure Hash, hash function is used to convert a string(or any other type) into an integer smaller than hash size and bigger or equal to zer 阅读全文
摘要:
Write an algorithm to determine if a number is happy. A happy number is a number defined by the following process: Starting with any positive integer, 阅读全文