Fork me on GitHub
摘要: 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-01 19:43 hellowOOOrld 阅读(531) 评论(0) 推荐(0)