sum:window内1的数量 while循环(纠正window size), we want to find a window that only contains a single zero and the rest of the elements are all ones. https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/discuss/708201/javaPython-3-Sliding-Window-with-at-most-one-zero-w-detailed-explanatio...