1004.max-consecutive-ones-iii.cs

using System;
/*
 * @lc app=leetcode id=1004 lang=csharp
 *
 * [1004] Max Consecutive Ones III
 *
 * https://leetcode.com/problems/max-consecutive-ones-iii/description/
 *
 * algorithms
 * Medium (57.92%)
 * Likes:    904
 * Dislikes: 20
 * Total Accepted:    47.4K
 * Total Submissions: 81.8K
 * Testcase Example:  '[1,1,1,0,0,0,1,1,1,1,0]\n2'
 *
 * 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 <= A.length <= 20000
 * 0 <= K <= A.length
 * A[i] is 0 or 1 
 *
 *
 *
 */

namespace _1004
{
    // @lc code=start
    public class Solution
    {
        public int LongestOnes(int[] A, int K)
        {
            int curr_zcount = 0, end = 0, start = 0;
            var res = 0;
            for (end = 0; end < A.Length; end++)
            {
                if (A[end] == 0)
                    curr_zcount++;

                while (curr_zcount > K && start < A.Length)
                {
                    if (A[start] == 0)
                        curr_zcount--;
                    start++;
                }
                res = Math.Max(res, end - start + 1);
            }
            return res;
        }
    }
    // @lc code=end
}