LeetCode747 Largest Number At Least Twice of Others

题目:

       In a given integer array nums, there is always exactly one largest element.Find whether the largest element in the array is at least twice as much as every other number in the array.If it is, return the index of the largest element, otherwise return -1.

Example 1:

       Input: nums = [3, 6, 1, 0]

       Output: 1

       Explanation: 6 is the largest integer, and for every other number in the array x, 6 is more than twice as big as x. The index of value 6 is 1, so we return 1.

Example 2:

       Input: nums = [1, 2, 3, 4]

       Output: -1

       Explanation: 4 isn't at least as big as twice the value of 3, so we return -1.

Note:

       nums will have a length in the range [1, 50].

       Every nums[i] will be an integer in the range [0, 99].

public class LargestNumberTwiceOthers {
    public static int dominantIndex(int[] nums) {
        if (nums == null || nums.length == 0)
            return -1;
        int maxValue = -1;
        int maxValueIndex = -1;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > maxValue){
                maxValue = nums[i];
                maxValueIndex = i;
            }
        }

        for (int i = 0; i < nums.length; i++) {
            if (i == maxValueIndex)
                continue;
            else if (maxValue < 2 * nums[i]){
                maxValueIndex = -1;
            }
        }

        return maxValueIndex;
    }

    public static void main(String[] args) {
        int[] nums = {1, 2, 3, 4};
        System.out.println(dominantIndex(nums));
    }
}

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值