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

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

Given an array A of 0s and 1s, we may change up to K values from 0 to 1.

Return the length of the longest (contiguous) subarray that contains only 1s.  

Example 1:

Input: A = [1,1,1,0,0,0,1,1,1,1,0], K = 2
Output: 6
Explanation: 
[1,1,1,0,0,1,1,1,1,1,1]
Bolded numbers were flipped from 0 to 1.  The longest subarray is underlined.

Example 2:

Input: A = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], K = 3
Output: 10
Explanation: 
[0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1]
Bolded numbers were flipped from 0 to 1.  The longest subarray is underlined. 

Note:

1. 1 <= A.length <= 20000
2. 0 <= K <= A.length
3. A[i] is 0 or 1 

---

给定一个由若干 0 和 1 组成的数组 A，我们最多可以将 K 个值从 0 变成 1 。

返回仅包含 1 的最长（连续）子数组的长度。 

示例 1：

输入：A = [1,1,1,0,0,0,1,1,1,1,0], K = 2
输出：6
解释： 
[1,1,1,0,0,1,1,1,1,1,1]
粗体数字从 0 翻转到 1，最长的子数组长度为 6。

示例 2：

输入：A = [0,0,1,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1], K = 3
输出：10
解释：
[0,0,1,1,1,1,1,1,1,1,1,1,0,0,0,1,1,1,1]
粗体数字从 0 翻转到 1，最长的子数组长度为 10。 

提示：

1. 1 <= A.length <= 20000
2. 0 <= K <= A.length
3. A[i] 为 0 或 1 

---

428ms

class Solution {    
    func longestOnes(_ A: [Int], _ K: Int) -> Int {
        var left = 0, right = 0, res = 0, zeroCount = 0
        
        while right < A.count {
            if A[right] == 0 { zeroCount += 1 }
            right += 1
            while(zeroCount > K) {
                if A[left] == 0 { zeroCount -= 1 }
                left += 1
            }            
            res = max(right - left, res)
        }        
        return res
    }
}

---

432ms

class Solution {
    func longestOnes(_ A: [Int], _ K: Int) -> Int {
        var i = 0, k = K
        var result = 0
        for j in 0..<A.count {
            if A[j] == 0 {
                k -= 1
            }
            while k < 0 {
                if A[i] == 0 {
                    k += 1
                }
                i += 1
            }
            result = max(result, j - i + 1)
        }
        return result
    }
}

---

460ms

class Queue<T>: CustomDebugStringConvertible, CustomStringConvertible {
    private var storage: Array<T>
    
    private var head = 0
    private var last = 0
    
    init(_ capacity: Int) {
        storage = Array()
        storage.reserveCapacity(capacity)
    }
    
    func isEmpty() -> Bool {
        return head == last
    }
    
    func push(_ val: T) {
        storage.append(val)
        last += 1
    }
    
    func pop() -> T {
        head += 1
        
        return storage[head - 1]
    }
    
    func forEach(_ block: (T)->Void) {
        for i in head..<last {
            block(storage[i])
        }
    }
    
    func first() -> T {
        return storage[head]
    }
    
    func count() -> Int {
        return last - head
    }
    
    var description: String {
        return debugDescription
    }
    
    var debugDescription: String {
        var str = "["
        forEach { str += "($0)," }
        str += "]"
        return str
    }
}


class Solution {
    func longestOnes(_ A: [Int], _ K: Int) -> Int {
        
        let queue = Queue<Int>(A.count)
        var current = 0
        var ans = 0

        for i in A.indices {
            if A[i] > 0 {
                current += 1
            } else if queue.count() < K {
                current += 1
                queue.push(i)
            } else if K > 0{
                current = i - queue.pop()
                queue.push(i)
            }
            
            ans = max(ans, current)
        }
        
        return ans
    }
}

---

Runtime: 476 ms

Memory Usage: 18.9 MB

class Solution {
    func longestOnes(_ A: [Int], _ K: Int) -> Int {
        var res:Int = 0
        var zero:Int = 0
        var left:Int = 0
        for right in 0..<A.count
        {
            if A[right] == 0
            {
                zero += 1
            }
            while (zero > K)
            {
                if A[left] == 0
                {
                    zero -= 1
                }
                left += 1
            }
            res = max(res, right - left + 1)
        }
        return res        
    }
}

---

Runtime: 576 ms

Memory Usage: 18.9 MB

class Solution {
    func longestOnes(_ A: [Int], _ K: Int) -> Int {
        var n:Int = A.count
        var pre:[Int] = [Int](repeating:0,count:n)
        for i in 0..<n
        {
            if A[i] == 0
            {
                pre[i] = 1
            }
        }
        for i in 1..<n
        {
            pre[i] = pre[i - 1] + pre[i]
        }
        var fans:Int = 0
        for i in -1..<(n - 1)
        {
            var lo:Int = i + 1
            var hi:Int = n - 1
            var ans:Int = i
            while(lo <= hi)
            {
                var mid:Int = (lo + hi) / 2
                var val:Int = pre[mid]
                if i >= 0
                {
                    val -= pre[i]
                }
                if val <= K
                {
                    ans = mid
                    lo = mid + 1
                }
                else
                {
                    hi = mid - 1
                }                
            }
            fans = max(fans, ans - i)
        }
        return fans    
    }
}