2015年7月8日
[LeetCode] Binary Search Tree Iterator
摘要： The key to this problem is to store the values in a stack. In the constructor and next, we add all the next smallest nodes into the stack. The followi... 阅读全文
posted @ 2015-07-08 14:20 jianchao-li 阅读(163) 评论(0) 推荐(0)
[LeetCode] Number of Digit One
摘要： The following idea is taken from a book named 《剑指offer》 published in China.Supposen = 271, it then breaks[1, 271]into[1, 71]and[72, 271]. For[72, 271]... 阅读全文
posted @ 2015-07-08 01:50 jianchao-li 阅读(622) 评论(0) 推荐(0)