zoukankan      html  css  js  c++  java
  • [leetcode-748-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:

    1. nums will have a length in the range [1, 50].
    2. Every nums[i] will be an integer in the range [0, 99].

    思路:

    扫描一遍数组,记录最大值与第二大的值,如果最大的是第二大的两倍以上,那么返回索引即可。

     int dominantIndex(vector<int>& nums)
     {
        int len = nums.size();
        int biggest = 0,second = 0,index = 0;
        
        for(int i=0;i<len;i++)
        {
            if(nums[i]>biggest)
            {
                second = biggest;
                biggest = nums[i];
                index = i;
            }
            else if(nums[i]>second)
            {
                second = nums[i];
            }
        }
        if(biggest>=second*2)return index;
        else return -1;        
     }
  • 相关阅读:
    1039 到底买不买 (20分)
    流密码
    Socket网络编程:互相通讯
    1036 跟奥巴马一起编程
    1033 旧键盘打字
    1029 旧键盘
    1015 德才论 (25分)
    BUU_Real_刷题记录
    vue3 composition api 对比 react hooks
    vue3 文档相关
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/8168661.html
Copyright © 2011-2022 走看看