2017年6月11日
[Leetcode] Binary search/tree-230. Kth Smallest Element in a BST
摘要： Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ? k ? BST's 阅读全文
posted @ 2017-06-11 23:24 安新 阅读(215) 评论(0) 推荐(0)
Scala--commonly used 1
摘要： Recently I transit to use scala to program. scala is a functional and objected oriented language, but it has seamless java Interoperability (they both 阅读全文
posted @ 2017-06-11 08:26 安新 阅读(207) 评论(0) 推荐(0)