zoukankan      html  css  js  c++  java
  • 747. 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.

     [暴力解法]:

    时间分析:

    空间分析:

     [优化后]:

    时间分析:

    空间分析:

    [奇葩输出条件]:

    [奇葩corner case]:

    数组应该考虑到只有一位数的情况

    [思维问题]:

    [一句话思路]:

    [输入量]:空: 正常情况:特大:特小:程序里处理到的特殊情况:异常情况(不合法不合理的输入):

    [画图]:

    [一刷]:

    1. "至少2倍"相当于>=

    [二刷]:

    [三刷]:

    [四刷]:

    [五刷]:

      [五分钟肉眼debug的结果]:

    [总结]:

    1. 数组应该考虑到只有一位数的情况

    [复杂度]:Time complexity: O(n) Space complexity: O(1)

    [英文数据结构或算法,为什么不用别的数据结构或算法]:

    [关键模板化代码]:

    [其他解法]:

    [Follow Up]:

    [LC给出的题目变变变]:

    414三位数

     [代码风格] :

    class Solution {
        public int dominantIndex(int[] nums) {
            //cc
            if (nums == null || nums.length == 0) {
                return -1;
            }
            if (nums.length == 1) {
                return 0;
            }
            
            //ini
            int max2 = Integer.MIN_VALUE, max1 = Integer.MIN_VALUE + 1, index = 0;
            
            //for loop, change max1 max2 
            for (int i = 0; i < nums.length; i++) {
                if (nums[i] > max1) {
                    max2 = max1;
                    max1 = nums[i];
                    index = i;
                }else if (nums[i] > max2) {
                    max2 = nums[i];
                }
            }
            
            //return
            return (max1 >= 2 * max2) ? index : -1;
        }
    }
    View Code
  • 相关阅读:
    设计模式-工厂设计模式
    Spring Batch BATCH_JOB_SEQ 出现死锁问题
    windows 安装 jenkins 自动化构建部署至linux服务器上
    Git安装
    MAVEN(一) 安装和环境变量配置
    Jenkins 安装
    jenkins操作
    linux firewalld 防火墙操作命令
    【Azure Redis 缓存】Azure Redis读写比较慢/卡的问题排查
    【Azure 服务总线】向服务总线发送消息时,返回错误代码Error code : 50009
  • 原文地址:https://www.cnblogs.com/immiao0319/p/8905714.html
Copyright © 2011-2022 走看看