[Swift]LeetCode674. 最长连续递增序列 | Longest Continuous Increasing Subsequence

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

Given an unsorted array of integers, find the length of longest continuous increasing subsequence (subarray).

Example 1:

Input: [1,3,5,4,7]
Output: 3
Explanation: The longest continuous increasing subsequence is [1,3,5], its length is 3. 
Even though [1,3,5,7] is also an increasing subsequence, it's not a continuous one where 5 and 7 are separated by 4.  

Example 2:

Input: [2,2,2,2,2]
Output: 1
Explanation: The longest continuous increasing subsequence is [2], its length is 1.  

Note: Length of the array will not exceed 10,000.

---

给定一个未经排序的整数数组，找到最长且连续的的递增序列。

示例 1:

输入: [1,3,5,4,7]
输出: 3
解释: 最长连续递增序列是 [1,3,5], 长度为3。
尽管 [1,3,5,7] 也是升序的子序列, 但它不是连续的，因为5和7在原数组里被4隔开。 

示例 2:

输入: [2,2,2,2,2]
输出: 1
解释: 最长连续递增序列是 [2], 长度为1。

注意：数组长度不会超过10000。

---

Runtime: 68 ms

Memory Usage: 19.1 MB

class Solution {
    func findLengthOfLCIS(_ nums: [Int]) -> Int {
        if nums.count == 0 {
            return 0
        }
        if nums.count == 1 {
            return 1
        }
        var maxLength = 1
        var count = 1
        for i in 1..<nums.count {
            if nums[i] > nums[i - 1] {
                count = count + 1
            } else {
                count = 1
            }
            maxLength = max(maxLength, count)
        }
        return maxLength
    }
}

---

68ms

class Solution {
    func findLengthOfLCIS(_ nums: [Int]) -> Int {
        var left = 0
        var right = 0
        var index = 0
        var result = 0
        
        while right < nums.count {
            while index < right {
                if nums[index] >= nums[right] {
                    left = index + 1
                }
                index += 1
            }
            result = max(result, right-left+1)
            right += 1
        }
        return result
    }
}

---

72ms

class Solution {
    func findLengthOfLCIS(_ nums: [Int]) -> Int {
        if nums.isEmpty {
            return 0
        }
        
        if nums.count == 1 {
            return 1
        }
        var count = 1
        var maxCount = count
        for i in 1...nums.count - 1 {
            if nums[i] > nums[i - 1] {
                count += 1
            }
            else {
                if count > maxCount {
                    maxCount = count
                }
                count = 1
            }
        }
        print(maxCount)
        return (maxCount > count ? maxCount : count)
    }
}

---

76ms

class Solution {
    func findLengthOfLCIS(_ nums: [Int]) -> Int {
        var longest = 0
        var currentLength = 0
        for (i, num) in nums.enumerated() {
            if i > 0 && num > nums[i - 1] {
                currentLength += 1
            } else {
                currentLength = 1
            }
            longest = max(longest, currentLength)
        }
        return longest
    }
}

---

84ms

class Solution {
    func findLengthOfLCIS(_ nums: [Int]) -> Int 
    {
        var temp_increasing_subsequence_length = 0
        var max_increasing_subsequence_length = 0
        
        guard nums.count >= 2 
        else
        {
            return nums.count
        }
        
        for i in 0...(nums.count - 2)
        {
            if (nums[i] < nums[i + 1])
            {
                temp_increasing_subsequence_length += 1
            }
            else
            {
                temp_increasing_subsequence_length = 0
            }
            
            max_increasing_subsequence_length = max(max_increasing_subsequence_length, temp_increasing_subsequence_length + 1)
        }
        
        return max_increasing_subsequence_length
    }
}

---

92ms

class Solution {
    func findLengthOfLCIS(_ nums: [Int]) -> Int {
        var dp = [Int](repeating: 0, count: nums.count) 
        var res = 0
        for (i , n) in nums.enumerated() {
            if i == 0 {
                dp[i] = 1
            }else if nums[i] > nums[i - 1]{
                dp[i] = dp[i - 1] + 1
                
            }else{
                dp[i] = 1
            }
            res = max(res, dp[i])
        }
        return res
    }
}

---

104ms

class Solution {
    func findLengthOfLCIS(_ nums: [Int]) -> Int {
  if(nums.isEmpty){
            return 0
        }
        if(nums.count == 1){
            return 1
        }
        
        var end:Int = 0
        var temp = 1
        var resultNum = 1
        
        for i in 1..<nums.count{
            if(nums[i] > nums[end]){
                end = i
                temp += 1
            }else{
                resultNum = max(temp, resultNum);
                temp = 1
                end = i
            }
            
        }
        
        return max(temp, resultNum);
    }
}