2016年2月8日
algorithm@ find kth smallest element in two sorted arrays (O(log n time)
摘要： The trivial way, O(m + n): Merge both arrays and the k-th smallest element could be accessed directly. Merging would require extra space of O(m+n). Th 阅读全文
posted @ 2016-02-08 01:59 流白 阅读(1017) 评论(0) 推荐(0) 编辑