1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-01-27 18:50:26 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
leetcode-problemset/leetcode-cn/problem (Chinese)/递归乘法 [recursive-mulitply-lcci].html

22 lines
491 B
HTML
Raw Normal View History

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