747. Largest Number At Least Twice of Others

题目：

You are given an integer array nums where the largest integer is unique.

Determine 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, or return -1 otherwise.

Example 1:

Input: nums = [3,6,1,0]
Output: 1
Explanation: 6 is the largest integer.
For every other number in the array x, 6 is at least 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 is less than twice the value of 3, so we return -1.

Example 3:

Input: nums = [1]
Output: 0
Explanation: 1 is trivially at least twice the value as any other number because there are no other numbers.

Constraints:

• 1 <= nums.length <= 50
• 0 <= nums[i] <= 100
• The largest element in nums is unique.

思路：

一次遍历就够，不需要两次。在一次遍历中找到最大值和次大值，并且记下最大值的index。这里注意两个初始化的记录值f和s设置成-1即可，如果设置成INT_MIN，数组只有{1}的话，最后判断就成了1 >= INT_MIN * 2，数字会爆。

代码：

class Solution {
public:
    int dominantIndex(vector<int>& nums) {
        int f = -1, s = -1;
        int index = -1;
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i] > f) {
                s = f;
                f = nums[i];
                index = i;
            } else if (nums[i] > s) {
                s = nums[i];
            }
        }
        return f >= s * 2 ? index: -1;
    }
};