LeetCode 2134. Minimum Swaps to Group All 1‘s Together II - 亚马逊高频题31

CP Coding

已于 2022-04-09 10:29:37 修改

阅读量831

点赞数 1

分类专栏：亚马逊高频题 Leetcode刷题笔记文章标签： leetcode 算法 python 数据结构 Sliding Window

于 2022-04-09 10:28:44 首次发布

本文链接：https://blog.youkuaiyun.com/hgq522/article/details/124055881

版权

给定一个二进制环形数组，目标是通过交换0和1将所有1聚集在一起，返回最小的交换次数。这道题可以采用滑动窗口法，由于数组是环形的，窗口在遍历结束时需要继续环绕，直到窗口回到起始位置。解题思路与LeetCode 1151类似，但在处理索引时需考虑环形特性，即索引取模。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A swap is defined as taking two distinct positions in an array and swapping the values in them.

A circular array is defined as an array where we consider the first element and the last element to be adjacent.

Given a binary circular array nums, return the minimum number of swaps required to group all 1's present in the array together at any location.

Example 1:

Input: nums = [0,1,0,1,1,0,0]
Output: 1
Explanation: Here are a few of the ways to group all the 1's together:
[0,0,1,1,1,0,0] using 1 swap.
[0,1,1,1,0,0,0] using 1 swap.
[1,1,0,0,0,0,1] using 2 swaps (using the circular property of the array).
There is no way to group all 1's together wit