<p>在Python中</p>
<pre><code>s= "ABCC"
n = len(s)
sorted(set([s[a:b] for a in range(n) for b in range(a+1,n+2)])
</code></pre>
<p>给我,没有重复的按字母顺序排序的子字符串</p>
^{pr2}$
<p>如何进一步按子串的长度排序呢。在</p>
<pre><code>['A', 'B', 'C', 'AB', 'BC', 'CC', 'ABC', 'BCC', 'ABCC']
</code></pre>