Leetcode995 Minimum Number of K Consecutive Bit Flips

##题目描述
In an array A containing only 0s and 1s, a K-bit flip consists of choosing a (contiguous) subarray of length K and simultaneously changing every 0 in the subarray to 1, and every 1 in the subarray to 0.

Return the minimum number of K-bit flips required so that there is no 0 in the array. If it is not possible, return -1.

Example 1:

Input: A = [0,1,0], K = 1
Output: 2
Explanation: Flip A[0], then flip A[2].

Example 2:

Input: A = [1,1,0], K = 2
Output: -1
Explanation: No matter how we flip subarrays of size 2, we can't make the array become [1,1,1].

Example 3:

Input: A = [0,0,0,1,0,1,1,0], K = 3
Output: 3
Explanation:
Flip A[0],A[1],A[2]: A becomes [1,1,1,1,0,1,1,0]
Flip A[4],A[5],A[6]: A becomes [1,1,1,1,1,0,0,0]
Flip A[5],A[6],A[7]: A becomes [1,1,1,1,1,1,1,1]

##思路
思路：先找到第一个0，找到第一个0以后，如果第一个0的位置i，i+k>当前数组的长度，则返回-1. 反之，在K循环里，对当前值进行按位异或(^=)且轮数加一。最后返回轮数。
##代码

class Solution {public int minKBitFlips(int[] A, int K) {int result=0;int i=0;while(i<A.length){if(A[i]==0){if(i+K>A.length)return -1;else{for(int j=0;j<K;j++){A[i+j]^=1;}result++;}}elsei++;}return result;}
}

Leetcode995 Minimum Number of K Consecutive Bit Flips解决方案相关推荐

LeetCode-995. K连续位的最小翻转次数(Minimum Number of K Consecutive Bit Flips)
K连续位的最小翻转次数在仅包含 0 和 1 的数组 A 中,一次 K 位翻转包括选择一个长度为 K 的(连续)子数组,同时将子数组中的每个 0 更改为 1,而每个 1 更改为 0. 返回所需的 K ...
LeetCode——1888. 使二进制字符串字符交替的最少反转次数(Minimum Number of Flips to Make the Binary ...)[中等]——分析及代码（Java）
LeetCode--1888. 使二进制字符串字符交替的最少反转次数[Minimum Number of Flips to Make the Binary String Alternating][中等 ...
LeetCode 202次周赛 1553. Minimum Number of Days to Eat N Oranges
1553. Minimum Number of Days to Eat N Oranges 题目描述思路分析弱智动态规划可行的动态规划直觉上正确的思路代码实现证明正确性复杂度分析总结 ...
452 Minimum Number of Arrows to Burst Balloons
452 Minimum Number of Arrows to Burst Balloons 文章目录 452 Minimum Number of Arrows to Burst Balloons 1 ...
codeforce 804B Minimum number of steps
cf劲啊原题: We have a string of letters 'a' and 'b'. We want to perform some operations on it. On each ...
871. Minimum Number of Refueling Stops
题目: A car travels from a starting position to a destination which is target miles east of the starti ...
LeetCode刷题：871. Minimum Number of Refueling Stops
LeetCode刷题:871. Minimum Number of Refueling Stops 原题链接:https://leetcode.com/problems/minimum-number- ...
LeetCode 871. Minimum Number of Refueling Stops 最少加油次数
LeetCode 871. Minimum Number of Refueling Stops 本题是LeetCode 871题,最少加油次数. 题目描述 A car travels from a s ...
LeetCode871.Minimum Number of Refueling Stops
871.Minimum Number of Refueling Stops(加油站的最小数量) Description Difficulty: hard Example 1: Example 2: E ...
算法设计与分析：Minimum Number of Refueling Stops（Week 11）
学号:16340008 题目:871. Minimum Number of Refueling Stops Question: A car travels from a starting positi ...

Leetcode995 Minimum Number of K Consecutive Bit Flips解决方案

Leetcode995 Minimum Number of K Consecutive Bit Flips

Leetcode995 Minimum Number of K Consecutive Bit Flips解决方案相关推荐

最新文章

热门文章