1 Star 0 Fork 332

大宇 / leetcode

forked from doocs / leetcode 
加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
README_EN.md 2.32 KB
一键复制 编辑 原始数据 按行查看 历史
ylb 提交于 2021-04-22 11:34 . feat: use relative path

1525. Number of Good Ways to Split a String

中文文档

Description

You are given a string s, a split is called good if you can split s into 2 non-empty strings p and q where its concatenation is equal to s and the number of distinct letters in p and q are the same.

Return the number of good splits you can make in s.

 

Example 1:

"aacaba"

Example 2:


Input: s = "abcd"

Output: 1

Explanation: Split the string as follows ("ab", "cd").

Example 3:


Input: s = "aaaaa"

Output: 4

Explanation: All possible splits are good.

Example 4:


Input: s = "acbadbaada"

Output: 2

 

Constraints:

  • s contains only lowercase English letters.
  • 1 <= s.length <= 10^5

Solutions

Python3

Java

...

马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/fdayu/leetcode.git
git@gitee.com:fdayu/leetcode.git
fdayu
leetcode
leetcode
main

搜索帮助

344bd9b3 5694891 D2dac590 5694891