search

1151. Minimum Swaps to Group All 1's Together (M)

Solution:

https://www.youtube.com/watch?v=9bjARZU5lvIarrow-up-right https://www.geeksforgeeks.org/minimum-swaps-required-group-1s-together/arrow-up-right 先计算出有M个1， 然后维护一个size = M的sliding window. 每一个划过去去找在这个Window里面最少要swap多少次

Previous1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit (M)Next2134. Minimum Swaps to Group All 1's Together II

Last updated