[Swift]LeetCode747. 至少是其他数字两倍的最大数 | Largest Number At Least Twice of Others

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（shanqingyongzhi）
➤博客园地址：山青咏芝（https://www.cnblogs.com/strengthen/）
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址： https://www.cnblogs.com/strengthen/p/10525612.html 
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

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].

---

在一个给定的数组nums中，总是存在一个最大元素 。

查找数组中的最大元素是否至少是数组中每个其他数字的两倍。

如果是，则返回最大元素的索引，否则返回-1。

示例 1:

输入: nums = [3, 6, 1, 0]
输出: 1
解释: 6是最大的整数, 对于数组中的其他整数,
6大于数组中其他元素的两倍。6的索引是1, 所以我们返回1. 

示例 2:

输入: nums = [1, 2, 3, 4]
输出: -1
解释: 4没有超过3的两倍大, 所以我们返回 -1. 

提示:

1. nums 的长度范围在[1, 50].
2. 每个 nums[i] 的整数范围在 [0, 99].

---

Runtime: 12 ms

Memory Usage: 18.7 MB

class Solution {
    func dominantIndex(_ nums: [Int]) -> Int {
        var mx:Int = Int.min
        var mxId:Int = 0
        for i in 0..<nums.count
        {
            if mx < nums[i]
            {
                mx = nums[i]
                mxId = i
            }
        }
        for num in nums
        {
            if mx != num && mx - num < num
            {
                return -1
            }
        }
        return mxId
    }
}

---

12ms

class Solution {
    func dominantIndex(_ nums: [Int]) -> Int {
    let maximumNumber = nums.max()!
    let index = nums.firstIndex(of: maximumNumber)!
     let _nums = nums.filter{$0 * 2 > maximumNumber}
       return _nums.count > 1 ? -1 : index        
    }
}

---

16ms

class Solution {
    func dominantIndex(_ nums: [Int]) -> Int {
        guard nums.count > 1 else {
            return 0
        }
        
       let ar = nums.enumerated().sorted{$0.1 > $1.1}
        if ar[0].1 >= 2*ar[1].1 {
            return ar[0].0
        }
        return -1
    }
}

---

16ms

class Solution {
    func dominantIndex(_ nums: [Int]) -> Int {
        if nums.count == 1 {
            return 0
        }
        
        var index: Int = 0
        var maxValue: Int = 0
        var secondValue: Int = 0
    
        for i in 0...nums.count - 1{            
            if nums[i] > maxValue{
                secondValue = maxValue
                maxValue = nums[i]
                index = i
            }else if nums[i] > secondValue{
                secondValue = nums[i]
            }           
        }
        
        return maxValue >= (secondValue * 2) ? index : -1
    }
}

---

20ms

class Solution {
    
    var greatestNumber = (index: -1, value: -1)
    var secondGreatestNumber = (index: -1, value: -1)
    var currentNumber = (index: -1, value: -1)
    
    func dominantIndex(_ nums: [Int]) -> Int {

        findTwoGreatestNumbers(in: nums)
        if greatestNumber.value >= secondGreatestNumber.value * 2 {
            return greatestNumber.index
        } else {
            return -1
        }
    }
    
    private func findTwoGreatestNumbers(in nums: [Int]) {
        for (index, value) in nums.enumerated() {
            currentNumber = (index,value)
            if currentNumber.value > greatestNumber.value {
                secondGreatestNumber = greatestNumber
                greatestNumber = currentNumber
            } else if currentNumber.value > secondGreatestNumber.value {
                secondGreatestNumber = currentNumber
            }
        }
    }
}

---

24ms

class Solution {
    func dominantIndex(_ nums: [Int]) -> Int {
        guard !nums.isEmpty else {
            return -1
        }
        
        var maxIndex = 0
        for index in 1..<nums.count {
            let num = nums[index]
            if num > nums[maxIndex] {
                maxIndex = index
            }
        }
        
        let maxNum = nums[maxIndex]
        for num in nums where num != 0 && num != maxNum {
            if maxNum / num < 2 {
                return -1
            }
        }
        
        return maxIndex
    }
}

---

28ms

class Solution {
    func dominantIndex(_ nums: [Int]) -> Int {
    guard let largestNumber = nums.sorted(by: >).first else { return -1 }
    let dominateNums = nums.filter({ $0 != largestNumber && largestNumber < ($0 * 2) })
    return dominateNums.isEmpty ? nums.index(of: largestNumber)! : -1
   }
}