Python3(3.5.2) 解法, 执行用时: 3169ms, 内存消耗: 28472K, 提交时间: 2020-08-12 15:41:11

class Solution:
    def solve(self , n , m , a ):
        # write code here
        l,r=0,0
        num =0
        ans=0
        while r<n:
            num+=1-a[r]
            while num>m:
                num-=1-a[l]
                l+=1
            ans=max(ans,r-l+1)
            r+=1
        return ans

Python(2.7.3) 解法, 执行用时: 2991ms, 内存消耗: 26468K, 提交时间: 2020-08-06 22:18:10

#
# 
# @param n int整型 
# @param m int整型 
# @param a int整型一维数组 
# @return int整型
#
class Solution:

    def solve(self, n, m, A):
        i = 0
        for j in xrange(n):
            m -= A[j] ^ 1
            if m < 0:
                m += A[i] ^ 1
                i += 1
        return j - i + 1

C++11(clang++ 3.9) 解法, 执行用时: 151ms, 内存消耗: 22132K, 提交时间: 2020-08-07 10:57:32

class Solution {public:int solve(int n, int m, vector<int>& a) {int l=0,r=-1,ans=0;while(r!=n-1){if(a[r+1]||m)m-=!a[++r];else m+=!a[l++];ans=max(ans,r-l+1);}return ans;}};