摘要： Convert a binary search tree to doubly linked list with in-order traversal. Have you met this question in a real interview? Yes Convert a binary searc 阅读全文

摘要： Calculate the an % b where a, b and n are all 32bit integers. Analyse: divide and conquer. Be aware of overflow. Runtime: 12ms 阅读全文

摘要： Print numbers from 1 to the largest number with N digits by recursion. Notice It's pretty easy to do recursion like: recursion(i) { if i > largest num 阅读全文