int dominantIndex(int* nums, int numsSize) {
if(numsSize <= 0) return -1;
int max = nums[0];
int smax = 0;
int i;
int flag = 0;
for(i = 1; i < numsSize; ++i){
if(nums[i] <= smax) continue;
if(nums[i] >= max){
smax = max;
max = nums[i];
flag = i;
}
else{
smax = nums[i];
}
}
if(max >= smax * 2) return flag;
else return -1;
}
if(numsSize <= 0) return -1;
int max = nums[0];
int smax = 0;
int i;
int flag = 0;
for(i = 1; i < numsSize; ++i){
if(nums[i] <= smax) continue;
if(nums[i] >= max){
smax = max;
max = nums[i];
flag = i;
}
else{
smax = nums[i];
}
}
if(max >= smax * 2) return flag;
else return -1;
}