LeetCode1422. Maximum Score After Splitting a String

最新推荐文章于 2024-10-03 23:25:47 发布

叶卡捷琳堡

最新推荐文章于 2024-10-03 23:25:47 发布

阅读量415

点赞数 9

文章标签：算法数据结构 c++ leetcode

本文链接：https://blog.csdn.net/weixin_46841376/article/details/135381591

版权

该篇文章介绍了一个编程问题，给定一个由0和1组成的字符串，目标是找到最优分割方式，使得两个非空子串中0的数目加1的数目之和最大。提供了一个Solution类的方法maxScore()来解决这个问题。

摘要由CSDN通过智能技术生成

文章目录

- 一、题目
- 二、题解

一、题目

Given a string s of zeros and ones, return the maximum score after splitting the string into two non-empty substrings (i.e. left substring and right substring).

The score after splitting a string is the number of zeros in the left substring plus the number of ones in the right substring.

Example 1:

Input: s = “011101”
Output: 5
Explanation:
All possible ways of splitting s into two non-empty substrings are:
left = “0” and right = “11101”, score = 1 + 4 = 5
left = “01” and right = “1101”, score = 1 + 3 = 4
left = “011” and right = “101”, score = 1 + 2 = 3
left = “0111” and right = “01”, score = 1 + 1 = 2
left = “01110” and right = “1”, score = 2 + 1 = 3
Example 2:

Input: s = “00111”
Output: 5
Explanation: When left = “00” and right = “111”, we get the maximum score = 2 + 3 = 5
Example 3:

Input: s = “1111”
Output: 3

Constraints:

2 <= s.length <= 500
The string s consists of characters ‘0’ and ‘1’ only.

二、题解

class Solution {
public:
    int maxScore(string s) {
        int n = s.size();
        int maxNum = 0;
        for(int i = 1;i < n;i++){
            int leftZero = 0,rightOne = 0;
            for(int j = 0;j < i;j++) if(s[j] == '0') leftZero++;
            for(int k = i;k < n;k++) if(s[k] == '1') rightOne++;
            maxNum = max(maxNum,leftZero+rightOne);
        }
        return maxNum;
    }
};