【LeetCode 926】 Flip String to Monotone Increasing

题目描述

A string of '0’s and '1’s is monotone increasing if it consists of some number of '0’s (possibly 0), followed by some number of '1’s (also possibly 0.)

We are given a string S of '0’s and '1’s, and we may flip any ‘0’ to a ‘1’ or a ‘1’ to a ‘0’.

Return the minimum number of flips to make S monotone increasing.

Example 1:

Input: "00110"
Output: 1
Explanation: We flip the last digit to get 00111.

Example 2:

Input: "010110"
Output: 2
Explanation: We flip to get 011111, or alternatively 000111.

Example 3:

Input: "00011000"
Output: 2
Explanation: We flip to get 00000000.

Note:

1 <= S.length <= 20000
S only consists of ‘0’ and ‘1’ characters.

思路

动态规划，dp[i][j]表示从0~i的字符串，以j结尾构成的递增序列的最少代价。

代码

class Solution {
public:
    int minFlipsMonoIncr(string S) {
        int n = S.length();
        vector<vector<int> > dp(n+1, vector<int>(2, INT_MAX/2));
        dp[0][S[0]-'0'] = 0;
        dp[0][1-(S[0]-'0')] = 1;
        
        for (int i=1; i<n; ++i) {
            if (S[i] == '0') {
                dp[i][0] = dp[i-1][0];
                dp[i][1] = min(dp[i-1][1], dp[i-1][0]) + 1;
            } else {
                dp[i][0] = dp[i-1][0] + 1;
                dp[i][1] = min(dp[i-1][1], dp[i-1][0]);
            }
        }
        
        return min(dp[n-1][0], dp[n-1][1]);
    }
};