mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
38 lines
1.5 KiB
HTML
38 lines
1.5 KiB
HTML
<p>Given two strings s and t, return <i>the number of distinct</i> <b><i>subsequences</i></b><i> of </i>s<i> which equals </i>t.</p>
|
|
|
|
<p>The test cases are generated so that the answer fits on a 32-bit signed integer.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "rabbbit", t = "rabbit"
|
|
<strong>Output:</strong> 3
|
|
<strong>Explanation:</strong>
|
|
As shown below, there are 3 ways you can generate "rabbit" from s.
|
|
<code><strong><u>rabb</u></strong>b<strong><u>it</u></strong></code>
|
|
<code><strong><u>ra</u></strong>b<strong><u>bbit</u></strong></code>
|
|
<code><strong><u>rab</u></strong>b<strong><u>bit</u></strong></code>
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> s = "babgbag", t = "bag"
|
|
<strong>Output:</strong> 5
|
|
<strong>Explanation:</strong>
|
|
As shown below, there are 5 ways you can generate "bag" from s.
|
|
<code><strong><u>ba</u></strong>b<u><strong>g</strong></u>bag</code>
|
|
<code><strong><u>ba</u></strong>bgba<strong><u>g</u></strong></code>
|
|
<code><u><strong>b</strong></u>abgb<strong><u>ag</u></strong></code>
|
|
<code>ba<u><strong>b</strong></u>gb<u><strong>ag</strong></u></code>
|
|
<code>babg<strong><u>bag</u></strong></code></pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= s.length, t.length <= 1000</code></li>
|
|
<li><code>s</code> and <code>t</code> consist of English letters.</li>
|
|
</ul>
|