class Solution {
public int dominantIndex(int[] nums) {
if (nums == null || nums.length == 1) {
return 0;
}
int max = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[max] < nums[i]) {
max = i;
}
}
Arrays.sort(nums);
return nums[nums.length - 1] >= (2 * nums[nums.length - 2]) ? max : -1;
}
}