zoukankan      html  css  js  c++  java
  • 747. Largest Number At Least Twice of Others

    package LeetCode_747
    
    /**
     * 747. Largest Number At Least Twice of Others
     * https://leetcode.com/problems/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].
     * */
    class Solution {
        /*
        * Time:O(n), Space:O(1)
        * */
        fun dominantIndex(nums: IntArray): Int {
            val max = nums.max()
            val index = nums.indexOf(max!!)
            val half = max / 2
            for (num in nums) {
                if (num == max) {
                    continue
                }
                if (half < num) {
                    return -1
                }
            }
            return index
        }
    }
  • 相关阅读:
    P1579哥德巴赫猜想
    JAVA快速入门方法
    PHP快速入门方法
    Java 8 lambda表达式
    JVM内存配置参数
    Synchronized 关键字
    数据库事务的理解
    hello world 执行原理
    面试知识点总结之JVM调优
    面试知识点总结之RabbitMQ/Kafka使用场景
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/14313980.html
Copyright © 2011-2022 走看看