Python C++ sliding windows解Leetcode 2134 Minimum Swaps to Group All 1'...

Python C++  sliding windows解Leetcode 2134  Minimum Swaps to Group All 1's Together II

使用sliding window, 由於陣列是循環的，所以右邊的游標r應該一直走到n+n0或n+n1

[Python  code請進]

-----