2017年6月19日
[Leetcode] Heap, Divide and conquer--215. Kth Largest Element in an Array
摘要： Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element. For exam 阅读全文
posted @ 2017-06-19 13:31 安新 阅读(310) 评论(0) 推荐(0) 编辑
[Leetcode] Binary search -- 222. Count Complete Tree Nodes
摘要： Given a complete binary tree, count the number of nodes. Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, ex 阅读全文
posted @ 2017-06-19 00:03 安新 阅读(217) 评论(0) 推荐(0) 编辑