674. 最长连续递增序列

贪心解法

func findLengthOfLCIS(_ nums: [Int]) -> Int {
        var start = 0
        var maxCount = 0

        for (index, _) in nums.enumerated() {
            if index > 0, nums[index] <= nums[index - 1] {
                start = index
            }
            let currentCount = index - start + 1
            maxCount = (maxCount > currentCount) ? maxCount : currentCount
        }
        return maxCount
    }

解法2

func findLengthOfLCIS(_ nums: [Int]) -> Int {
        if nums.count < 2 {
            return nums.count
        }
        var maxCount = 0
        var preNumber = nums.first
        var tempCount = 0
        for item in nums {
            let isAdd = item > preNumber!
            if isAdd {
                tempCount += 1
                maxCount = (maxCount > tempCount) ? maxCount : tempCount
            } else {
                tempCount = 0
            }
            preNumber = item
        }
        return maxCount + 1
    }