菜题,我觉得应该不会有人看这篇博客。
AC代码:
class Solution {
public:
int dominantIndex(vector<int>& nums) {
int n = nums.size();
if(n == 1)
return 0;
int max = 0;
int res;
for(int i = 0; i < n; i++)
if(nums[i] > max) {
res = i;
max = nums[i];
}
sort(nums.begin(), nums.end());
if(nums[n - 1] >= nums[n - 2] * 2)
return res;
return -1;
}
};