摘要: 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 阅读全文
posted @ 2018-01-30 22:06 Grandyang 阅读(3365) 评论(0) 推荐(0) 编辑
Fork me on GitHub