2018年12月6日

160 Find K Closest Elements

摘要： Solution 1 : Log n + k http://www.cnblogs.com/grandyang/p/7519466.html https://shineboy2013.github.io/2018/01/28/lee-658/ // correct class Solution { 阅读全文

posted @ 2018-12-06 21:53 猪猪🐷 阅读(176) 评论(0) 推荐(0)

162. Find Peak Element

摘要： A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return 阅读全文

posted @ 2018-12-06 20:06 猪猪🐷 阅读(107) 评论(0) 推荐(0)

导航