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.
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.
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.
numswill have a length in the range
nums[i]will be an integer in the range
Intuition and Algorithm\n
Scan through the array to find the unique largest element
m, keeping track of it\'s index
Scan through the array again. If we find some
x != m with
m < 2*x, we should return
Otherwise, we should return
Time Complexity: where is the length of
Space Complexity: , the space used by our
Analysis written by: @awice.\n