mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-13 11:21:42 +08:00
add leetcode problem-cn part1
This commit is contained in:
@@ -0,0 +1,35 @@
|
||||
<p>你有一套活字字模 <code>tiles</code>,其中每个字模上都刻有一个字母 <code>tiles[i]</code>。返回你可以印出的非空字母序列的数目。</p>
|
||||
|
||||
<p><strong>注意:</strong>本题中,每个活字字模只能使用一次。</p>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>示例 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong>"AAB"
|
||||
<strong>输出:</strong>8
|
||||
<strong>解释:</strong>可能的序列为 "A", "B", "AA", "AB", "BA", "AAB", "ABA", "BAA"。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong>"AAABBC"
|
||||
<strong>输出:</strong>188
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>输入:</strong>"V"
|
||||
<strong>输出:</strong>1</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
<p><strong>提示:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= tiles.length <= 7</code></li>
|
||||
<li><code>tiles</code> 由大写英文字母组成</li>
|
||||
</ul>
|
Reference in New Issue
Block a user