LeetCode 747 JavaScript

/**
 * @param {number[]} nums
 * @return {number}
 */
var dominantIndex = function(nums) {
    let len = nums.length;
    if(len < 2) {
        return 0;
    }
    let index;
    let max = Number.MIN_SAFE_INTEGER;
    for(let i = 0; i < len; ++i) {
        if(nums[i] > max) {
            max = nums[i];
            index = i;
        }
    }
    nums.sort((a, b) => b - a);
    if(nums[0] >= nums[1] * 2) {
        return index;
    }
    return -1;
};
複製程式碼