2017年6月10日
[Leetcode] Binary search, Divide and conquer--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 @ 2017-06-10 23:56 安新 阅读(214) 评论(0) 推荐(0)
[Leetcode] Binary search--275 H-Index
摘要： Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm? Solution: # this is could also be 阅读全文
posted @ 2017-06-10 10:44 安新 阅读(172) 评论(0) 推荐(0)
[Leetcode] Sort, Hash -- 274. H-Index
摘要： Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. According 阅读全文
posted @ 2017-06-10 09:02 安新 阅读(178) 评论(0) 推荐(0)