【文件属性】：
文件名称：leetcode卡-leetcode-weekly-contest-186:第186届LeetCode周赛
文件大小：15KB
文件格式：ZIP
更新时间：2021-07-06 20:48:26
系统开源
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
【文件预览】：
leetcode-weekly-contest-186-master
----.gitignore(269B)
----go.mod(63B)
----maximum-Points-You-Can-Obtain-from-Cards.go(3KB)
----maximum-Points-You-Can-Obtain-from-Cards_test.go(3KB)
----diagonal-Traverse-II.go(1KB)
----LICENSE(11KB)
----main.go(31B)
----README.md(4KB)
----commonFunc.go(237B)
----diagonal-Traverse-II_test.go(2KB)
----constrainedSubsequenceSum.go(1KB)
----maximum-Score-After-Splitting-a-String.go(2KB)
----constrainedSubsequenceSum_test.go(2KB)
----maximum-Score-After-Splitting-a-String_test.go(2KB)