leetcode 926. Flip String to Monotone Increasing | 926. 将字符串翻转到单调递增（前缀和）

题目

https://leetcode.com/problems/flip-string-to-monotone-increasing/

题解

方法1：前缀和

class Solution {public int minFlipsMonoIncr(String s) {int L = s.length();// i位置左边1的个数int[] leftOne = new int[L];for (int i = 0; i < L - 1; i++) {if (s.charAt(i) == '1') leftOne[i + 1] = leftOne[i] + 1;else leftOne[i + 1] = leftOne[i];}// i位置右边0的个数int[] rightZero = new int[L];for (int i = L - 1; i > 0; i--) {if (s.charAt(i) == '0') rightZero[i - 1] = rightZero[i] + 1;else rightZero[i - 1] = rightZero[i];}// 将i左边全变成1，i右边全变成0，总共需要改的个数int minSum = Integer.MAX_VALUE;for (int i = 0; i < L; i++) {minSum = Math.min(minSum, leftOne[i] + rightZero[i]);}return minSum;}
}

方法2：dp

int minFlipsMonoIncr(char *s) {int z = *s == '0' ? 0 : 1;int o = *s == '0' ? 1 : 0;for (s++; *s; s++){if (*s == '0'){o = (z < o ? z : o) + 1;}else{o = (z < o ? z : o);z++;}}return z < o ? z : o;
}

leetcode 926. Flip String to Monotone Increasing | 926. 将字符串翻转到单调递增（前缀和）相关推荐

LeetCode 926. 将字符串翻转到单调递增（动态规划）
文章目录 1. 题目 2. 解题 1. 题目如果一个由 '0' 和 '1' 组成的字符串,是以一些 '0'(可能没有 '0')后面跟着一些 '1'(也可能没有 '1')的形式组成的,那么该字符串是单 ...
Leetcode 738. Monotone Increasing Digits
原题链接:https://leetcode.com/problems/monotone-increasing-digits/description/ 描述: Given a non-negative ...
leetcode 1239. Maximum Length of a Concatenated String with Unique Characters | 1239. 串联字符串的最大长度（回溯）
题目 https://leetcode.com/problems/contiguous-array/ 题解回溯法,每个字符串都有可能加或者不加. class Solution {int N;publ ...
LeetCode算法入门- String to Integer (atoi)-day7
LeetCode算法入门- String to Integer (atoi)-day7 String to Integer (atoi): Implement atoi which converts ...
【To Understand !!! DP or 递归】LeetCode 87. Scramble String
LeetCode 87. Scramble String 参考链接:[1]https://blog.csdn.net/makuiyu/article/details/44926439 [2]http: ...
【重点！DP】LeetCode 97. Interleaving String
LeetCode 97. Interleaving String 参考网址:[1]https://www.youtube.com/watch?v=HmAF9xeS_2I [2]http://www.c ...
leetcode 971. Flip Binary Tree To Match Preorder Traversal
leetcode 971. Flip Binary Tree To Match Preorder Traversal 题意:给一颗二叉树,再给一个的数组,能否通过交换两个左右两个子节点,使得二叉树的前 ...
[LeetCode]844. Backspace String Compare 解题报告(C++)
[LeetCode]844. Backspace String Compare 解题报告(C++) 题目描述 Given two strings S and T, return if they are ...
738. Monotone Increasing Digits
内容: Given a non-negative integer N, find the largest number that is less than or equal to N with mon ...

leetcode 926. Flip String to Monotone Increasing | 926. 将字符串翻转到单调递增（前缀和）

题目

题解

方法1：前缀和

方法2：dp

leetcode 926. Flip String to Monotone Increasing | 926. 将字符串翻转到单调递增（前缀和）相关推荐

最新文章

热门文章