【数组】至少是其他数字两倍的最大数

 1 class Solution {
 2 public:
 3     int dominantIndex(vector<int>& nums) 
 4     {
 5         int max1 = -1;
 6         int max2 = -1;
 7         int maxIndex = 0;
 8         
 9         for(int i = 0; i < nums.size(); i++)
10         {
11             if(nums[i] > max1)
12             {
13                 max2 = max1;
14                 max1 = nums[i];
15                 maxIndex = i;
16             }
17             else if(nums[i] > max2)
18             {
19                 max2 = nums[i];
20             }
21         }
22         
23         return max1 >= 2 * max2 ? maxIndex : -1;
24     }
25 };