Solution1 Sliding window

convert problem from "max K 0 to 1" to "find a subarray which contains at most K 0".