mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 03:33:12 +08:00
22 lines
567 B
HTML
22 lines
567 B
HTML
<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>
|
|
|