2016年4月1日
240. Search a 2D Matrix II
摘要： Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Integers in each row are sorted i 阅读全文
posted @ 2016-04-01 12:18 Joyce-Lee 阅读(197) 评论(0) 推荐(0)
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 @ 2016-04-01 11:45 Joyce-Lee 阅读(506) 评论(0) 推荐(0)