coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-03 22:42:52 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode-cn/problem (English)/解码方法 II(English) [decode-ways-ii].html
View File

@@ -23,7 +23,7 @@
<p>Since the answer may be very large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>
<p>&nbsp;</p>
<p><strong>Example 1:</strong></p>
<p><strong class="example">Example 1:</strong></p>
<pre>
<strong>Input:</strong> s = &quot;*&quot;
@@ -33,7 +33,7 @@ Each of these can be decoded to the strings &quot;A&quot;, &quot;B&quot;, &quot;
Hence, there are a total of 9 ways to decode &quot;*&quot;.
</pre>
<p><strong>Example 2:</strong></p>
<p><strong class="example">Example 2:</strong></p>
<pre>
<strong>Input:</strong> s = &quot;1*&quot;
@@ -43,7 +43,7 @@ Each of these encoded messages have 2 ways to be decoded (e.g. &quot;11&quot; ca
Hence, there are a total of 9 * 2 = 18 ways to decode &quot;1*&quot;.
</pre>
<p><strong>Example 3:</strong></p>
<p><strong class="example">Example 3:</strong></p>
<pre>
<strong>Input:</strong> s = &quot;2*&quot;