Problem: https://leetcode.com/problems/largest-number-at-least-twice-of-others/
class Solution {
public int dominantIndex(int[] nums) {
int max = 0;
int max_idx = 0;
for(int i = 0; i < nums.length; i++){
if(nums[i] > max){
max = nums[i];
max_idx = i;
}
}
for(int i = 0; i < nums.length; i++){
if(max < 2*nums[i] && i != max_idx) {
return -1;
}
}
return max_idx;
}
}
TC: O(n)
SC: O(1)