[Swift]LeetCode162. 寻找峰值 | Find Peak Element

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

A peak element is an element that is greater than its neighbors.

Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return its index.

The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.

You may imagine that nums[-1] = nums[n] = -∞.

Example 1:

Input: nums = [1,2,3,1]
Output: 2
Explanation: 3 is a peak element and your function should return the index number 2.

Example 2:

Input: nums = [1,2,1,3,5,6,4]
Output: 1 or 5 
Explanation: Your function can return either index number 1 where the peak element is 2, 
             or index number 5 where the peak element is 6.

Note:

Your solution should be in logarithmic complexity.

---

峰值元素是指其值大于左右相邻值的元素。

给定一个输入数组 nums，其中 nums[i] ≠ nums[i+1]，找到峰值元素并返回其索引。

数组可能包含多个峰值，在这种情况下，返回任何一个峰值所在位置即可。

你可以假设 nums[-1] = nums[n] = -∞。

示例 1:

输入: nums = [1,2,3,1]
输出: 2
解释: 3 是峰值元素，你的函数应该返回其索引 2。

示例 2:

输入: nums = [1,2,1,3,5,6,4]
输出: 1 或 5 
解释: 你的函数可以返回索引 1，其峰值元素为 2；
     或者返回索引 5， 其峰值元素为 6。

说明:

你的解法应该是 O(logN) 时间复杂度的。

---

32ms

class Solution {
    func findPeakElement(_ nums: [Int]) -> Int {
        var low = 0
        var high = nums.count - 1
        
        while low != high {
            let mid = (low + high)/2
            
            if !nums.indices.contains(mid - 1) {
                if nums[mid + 1] < nums[mid] { return mid }
                low = mid + 1
                continue
            }
            
            if nums[mid - 1] < nums[mid] && nums[mid + 1] < nums[mid] {
                return mid
            } 
            
            if nums[mid - 1] < nums[mid] && nums[mid + 1] > nums[mid] {
                low = mid + 1
                continue
            }
            
            high = mid - 1
        }
        
        return high
    }
}

---

36ms

class Solution {
    func findPeakElement(_ nums: [Int]) -> Int {
            guard nums.count > 1 else{
                return 0
            }
            var left = 0
            var right = nums.count  - 1
            while left < right{
                let middle = (left + right) / 2
                if nums[middle] > nums[middle + 1] {
                    right = middle 
                }else{
                    left = middle + 1
                }
            }
        
        return left
        
    }
    
}

---

40ms

class Solution {
    func findPeakElement(_ nums: [Int]) -> Int {
        if nums.count >= 3 {
            for i in Array(1..<nums.count - 1) {
                let left = nums[i - 1]
                let value = nums[i]
                let right = nums[i + 1]

                if value > left && value > right {
                    return i
                }
            }
        }
        
        let lower = 0
        let upper = nums.count - 1
        
        return nums[lower] >= nums[upper] ? lower : upper
    }
}

---

44ms

class Solution {
    func findPeakElement(_ nums: [Int]) -> Int {
        var low = 0
        var high = nums.count - 1
        
        while low != high {
            let mid = (low + high)/2
            
            if !nums.indices.contains(mid - 1) || nums[mid - 1] < nums[mid] {
                if nums[mid + 1] < nums[mid] { return mid }
                low = mid + 1
                continue
            }
            
            high = mid - 1
        }
        
        return high
    }
}

---

52ms

class Solution {
    func findPeakElement(_ nums: [Int]) -> Int {
var left = 0
    var right = nums.count - 1
    var mid = 0
    
    while left < right {
        mid = (right - left) / 2 + left
        
        if nums[mid] > nums[mid + 1] {
            right = mid
        } else {
            left = mid + 1
        }
    }
    return left
    }
}