摘要: In a given integer array nums, there is always exactly one largest element. Find whether the largest element in the array is at least twice as much as every other number in the array. If it is, ret... 阅读全文
posted @ 2017-12-26 22:16 xiejunzhao 阅读(462) 评论(0) 推荐(0)
摘要: Given a non-empty array of integers, return the k most frequent elements.For example, Given [1,1,1,2,2,3] and k = 2, return [1,2]. Note: You may assume k is always valid, 1 ≤ k ≤ number of unique ele... 阅读全文
posted @ 2017-12-26 00:14 xiejunzhao 阅读(253) 评论(0) 推荐(0)