题目:
n 个字符构成的字符串,假设每个字符都不一样,问有多少个子串?
Given a string with n characters, suppose all the characters are different from each other, how many different substrings do we have?
A.n+1
B.n(n+1)/2 + 1
C.2^n-1
D.n!
答案:B
知识点:子串
解析: 注意子串包含串本身和空串,因此子串数目应为(1+2+3+…+n-1+n)+1。