1. 首页
  2. 考试认证
  3. 其它
  4. leetcode卡 leetcode weekly contest 186 第186届LeetCode周赛

leetcode卡 leetcode weekly contest 186 第186届LeetCode周赛

上传者: 2024-10-07 01:51:01上传 ZIP文件 14.59KB 热度 8次
leetcode卡leetcode-weekly-contest-186第186届LeetCode周赛问题清单拆分字符串后的最大分数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
下载地址
用户评论