coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-12 17:05:15 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2025-09-29 14:43:44 +08:00
parent 2862a227c4
commit 13f2098086
4409 changed files with 168933 additions and 166256 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
leetcode-cn/problem (Chinese)/递归乘法 [recursive-mulitply-lcci].html
View File

@@ -1,21 +1,21 @@
<p>递归乘法。 写一个递归函数，不使用 * 运算符， 实现两个正整数的相乘。可以使用加号、减号、位移，但要吝啬一些。</p>
<p> <strong>示例1:</strong></p>
<p><strong>示例 1：</strong></p>
<pre>
<strong> 输入</strong>：A = 1, B = 10
<strong> 输出</strong>：10
</pre>
<p> <strong>示例2:</strong></p>
<p><strong>示例 2：</strong></p>
<pre>
<strong> 输入</strong>：A = 3, B = 4
<strong> 输出</strong>：12
</pre>
<p> <strong>提示:</strong></p>
<p><strong>提示：</strong></p>
<ol>
<li>保证乘法范围不会溢出</li>
<li>保证乘法范围不会溢出</li>
</ol>