coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 19:46:47 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

更新国内版力扣题目描述变更

Browse Source
This commit is contained in:
小墨
2022-05-02 23:42:43 +08:00
parent 74598d1cf8
commit 7ea03594b3
198 changed files with 11378 additions and 11118 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,21 +1,21 @@
<p>Write a recursive function to multiply two positive integers without using the * operator. You can use addition, subtraction, and bit shifting, but you should minimize the number of those operations.</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong> Input</strong>: A = 1, B = 10
<strong> Output</strong>: 10
</pre>
<p><strong>Example 2:</strong></p>
<pre>
<strong> Input</strong>: A = 3, B = 4
<strong> Output</strong>: 12
</pre>
<p><strong>Note:</strong></p>
<ol>
<li>The result will not overflow.</li>
</ol>
<p>Write a recursive function to multiply two positive integers without using the * operator. You can use addition, subtraction, and bit shifting, but you should minimize the number of those operations.</p>
<p><strong>Example 1:</strong></p>
<pre>
<strong> Input</strong>: A = 1, B = 10
<strong> Output</strong>: 10
</pre>
<p><strong>Example 2:</strong></p>