码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] Largest Number At Least Twice of Others 至少是其他数字两倍的最大数

时间:2018-01-31 01:04:52      阅读:128      评论:0      收藏:0      [点我收藏+]

标签:return   exp   数字   div   always   nbsp   for   exactly   bsp   

 

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, return the index of the largest element, otherwise return -1.

Example 1:

Input: nums = [3, 6, 1, 0]
Output: 1
Explanation: 6 is the largest integer, and for every other number in the array x,
6 is more than twice as big as x.  The index of value 6 is 1, so we return 1.

 

Example 2:

Input: nums = [1, 2, 3, 4]
Output: -1
Explanation: 4 isn‘t at least as big as twice the value of 3, so we return -1.

 

Note:

  1. nums will have a length in the range [1, 50].
  2. Every nums[i] will be an integer in the range [0, 99].

 

s

 

[LeetCode] Largest Number At Least Twice of Others 至少是其他数字两倍的最大数

标签:return   exp   数字   div   always   nbsp   for   exactly   bsp   

原文地址:https://www.cnblogs.com/grandyang/p/8387593.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!