数据结构和算法分析LeetCode

896. Monotonic Array

2018-09-16  本文已影响1人  楷书

https://leetcode.com/problems/monotonic-array/description/

Algorithm - array

基本的数组扫描

class Solution {
    func isMonotonic(_ A: [Int]) -> Bool {
        guard A.count >= 1 else {
            return true
        }
        
        let isIncreased = A[0] <= A[A.count - 1] ? true : false
        
        for i in 1..<A.count {
            if isIncreased {
                if A[i-1] > A[i] {
                    return false
                }
            } else {
                if A[i-1] < A[i] {
                    return false
                }
            }
        }
        
        return true
    }
}
上一篇下一篇

猜你喜欢

热点阅读