Cacher is the code snippet organizer for pro developers

class Solution {
public:
    int dominantIndex(vector<int>& nums) {
        if (nums.size() <= 0) return -1;
        
        int max = nums[0];
        int secondMax = 0;
        int maxIndex = 0;
        
        for (int i = 1; i < nums.size(); i++) {
            if (nums[i] > max) {
                secondMax = max;
                max = nums[i];
                maxIndex = i;
            } else if (nums[i] > secondMax) {
                secondMax = nums[i];
            }
        }
        
        if (max >= 2 * secondMax) {
            return maxIndex;
        }
        
        return -1;
    }
};