mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-10 18:48:13 +08:00
38 lines
1.5 KiB
HTML
38 lines
1.5 KiB
HTML
<p>Given two numbers <code>arr1</code> and <code>arr2</code> in base <strong>-2</strong>, return the result of adding them together.</p>
|
|
|
|
<p>Each number is given in <em>array format</em>: as an array of 0s and 1s, from most significant bit to least significant bit. For example, <code>arr = [1,1,0,1]</code> represents the number <code>(-2)^3 + (-2)^2 + (-2)^0 = -3</code>. A number <code>arr</code> in <em>array, format</em> is also guaranteed to have no leading zeros: either <code>arr == [0]</code> or <code>arr[0] == 1</code>.</p>
|
|
|
|
<p>Return the result of adding <code>arr1</code> and <code>arr2</code> in the same format: as an array of 0s and 1s with no leading zeros.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr1 = [1,1,1,1,1], arr2 = [1,0,1]
|
|
<strong>Output:</strong> [1,0,0,0,0]
|
|
<strong>Explanation: </strong>arr1 represents 11, arr2 represents 5, the output represents 16.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr1 = [0], arr2 = [0]
|
|
<strong>Output:</strong> [0]
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 3:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> arr1 = [0], arr2 = [1]
|
|
<strong>Output:</strong> [1]
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= arr1.length, arr2.length <= 1000</code></li>
|
|
<li><code>arr1[i]</code> and <code>arr2[i]</code> are <code>0</code> or <code>1</code></li>
|
|
<li><code>arr1</code> and <code>arr2</code> have no leading zeros</li>
|
|
</ul>
|