[Swift]LeetCode485. 最大连续1的个数 | Max Consecutive Ones

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

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

Given a binary array, find the maximum number of consecutive 1s in this array.

Example 1:

Input: [1,1,0,1,1,1]
Output: 3
Explanation: The first two digits or the last three digits are consecutive 1s.
    The maximum number of consecutive 1s is 3. 

Note:

• The input array will only contain 0 and 1.
• The length of input array is a positive integer and will not exceed 10,000

---

给定一个二进制数组， 计算其中最大连续1的个数。

示例 1:

输入: [1,1,0,1,1,1]
输出: 3
解释: 开头的两位和最后的三位都是连续1，所以最大连续1的个数是 3.

注意：

• 输入的数组只包含 0 和1。
• 输入数组的长度是正整数，且不超过 10,000。

---

 56ms

class Solution {
    func findMaxConsecutiveOnes(_ nums: [Int]) -> Int {
        if nums.count == 1 && nums[0] == 1{
            return 1
        }
        var count = 0
        var res = 0
        
        for i in 0..<nums.count {
           if(nums[i] == 1)  { count = count + 1 }//遇1则加
            if(count > res)  { res = count }//判断是否大于当前最大连续值
            if(nums[i] == 0)  { count = 0 }//遇0则置为0 
        }
        return res
    }
}

---

64ms

class Solution {
    func findMaxConsecutiveOnes(_ nums: [Int]) -> Int {
        var count = 0
        var maxcount = 0
        for num in nums {
            if num == 1 {
                count = count + 1
                maxcount = max(count,maxcount)
            } else {
                count = 0
            } 
        }
        
        return maxcount
    }
}

---

76ms

class Solution {
    func findMaxConsecutiveOnes(_ nums: [Int]) -> Int {
        var res = 0
        var currentCount = 0

        for num in nums {
            if num == 1 {
                currentCount += 1
            } else {
                currentCount = 0
            }
            if currentCount > res {
                res = currentCount
            }
        }

        return res
    }
}

---

80ms

class Solution {
    func findMaxConsecutiveOnes(_ nums: [Int]) -> Int {
        var result: Int = 0
        var count: Int = 0
        for num in nums {
            if num != 1{
                if count > result{
                    result = count
                }
                count = 0
            }else{
                count += 1
            }
        }
        return max(count, result)
    }
}

---

312ms

class Solution {
    func findMaxConsecutiveOnes(_ nums: [Int]) -> Int {
        var start = -1
        var maxLength = 0
        
        for i in 0 ..< nums.count {
            switch (nums[i], start) {
            case (1, -1):
                start = i
            case (1, _), (0, -1):
                break
            case (0, _):
                maxLength = max(maxLength, i - start)
                start = -1
            default:
                break
            }
        }
        
        if start >= 0 {
            maxLength = max(maxLength, nums.count - start)
        }
        
        return maxLength
    }
}

---

Runtime: 328 ms

Memory Usage: 19.2 MB

class Solution {
    func findMaxConsecutiveOnes(_ nums: [Int]) -> Int {
        var count = 0
        var returnNum = 0
        
        for num in nums {
            count = (count + 1) * num
            returnNum = max(returnNum, count)
        }
        
        return returnNum       
    }
}