[LeetCode]747. Largest Number At Least Twice of Others 解题报告(C++)

[LeetCode]747. Largest Number At Least Twice of Others 解题报告(C++)

题目描述

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.

题目大意

• 知道最大的数.看这个数是不是至少是其他数的两倍.
• 是的话返回索引.否则返回-1.

解题思路

方法1:

• 找到最大的数和第二大数.同时保存第一大的数的索引
• 若最大的数至少是第二大的数.则找到了.

代码实现:

class Solution {
public:
    int dominantIndex(vector<int>& nums) {

        int mx1 = INT_MIN, mx2 = INT_MIN;
        int mx1pos = -1;
        for(int i=0;i<nums.size();i++){
            if (nums[i] > mx1) {
                mx2 = mx1;
                mx1 = nums[i];
                mx1pos = i;
            }
            else if (nums[i]  > mx2) {
                mx2 = nums[i];
            }
        }
        return (mx1 >= 2 * mx2 ? mx1pos : -1);
    }
};

---

小结

• easy!