列表

详情


1698. 字符串的不同子字符串个数

给定一个字符串 s,返回 s 的不同子字符串的个数。

字符串的 子字符串 是由原字符串删除开头若干个字符(可能是 0 个)并删除结尾若干个字符(可能是 0 个)形成的字符串。

 

示例 1:

输入:s = "aabbaba"
输出:21
解释:不同子字符串的集合是 ["a","b","aa","bb","ab","ba","aab","abb","bab","bba","aba","aabb","abba","bbab","baba","aabba","abbab","bbaba","aabbab","abbaba","aabbaba"]

示例 2:

输入:s = "abcdefg"
输出:28

 

提示:

进阶:你可以以 O(n) 时间复杂度解决此问题吗?

原站题解

去查看

上次编辑到这里,代码来自缓存 点击恢复默认模板
class Solution { public: int countDistinct(string s) { } };

上一题