mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-23 05:48:57 +08:00
update
This commit is contained in:
@@ -12,7 +12,7 @@
|
||||
"translatedContent": "<p>给出基数为 <strong>-2</strong> 的两个数 <code>arr1</code> 和 <code>arr2</code>,返回两数相加的结果。</p>\n\n<p>数字以 <em>数组形式</em><strong> </strong>给出:数组由若干 0 和 1 组成,按最高有效位到最低有效位的顺序排列。例如,<code>arr = [1,1,0,1]</code> 表示数字 <code>(-2)^3 + (-2)^2 + (-2)^0 = -3</code>。<em>数组形式</em> 中的数字 <code>arr</code> 也同样不含前导零:即 <code>arr == [0]</code> 或 <code>arr[0] == 1</code>。</p>\n\n<p>返回相同表示形式的 <code>arr1</code> 和 <code>arr2</code> 相加的结果。两数的表示形式为:不含前导零、由若干 0 和 1 组成的数组。</p>\n\n<p> </p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong>arr1 = [1,1,1,1,1], arr2 = [1,0,1]\n<strong>输出:</strong>[1,0,0,0,0]\n<strong>解释:</strong>arr1 表示 11,arr2 表示 5,输出表示 16 。\n</pre>\n\n<p><meta charset=\"UTF-8\" /></p>\n\n<p><strong>示例 2:</strong></p>\n\n<pre>\n<strong>输入:</strong>arr1 = [0], arr2 = [0]\n<strong>输出:</strong>[0]\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong>arr1 = [0], arr2 = [1]\n<strong>输出:</strong>[1]\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n<meta charset=\"UTF-8\" />\n\n<ul>\n\t<li><code>1 <= arr1.length, arr2.length <= 1000</code></li>\n\t<li><code>arr1[i]</code> 和 <code>arr2[i]</code> 都是 <code>0</code> 或 <code>1</code></li>\n\t<li><code>arr1</code> 和 <code>arr2</code> 都没有前导0</li>\n</ul>\n",
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 32,
|
||||
"likes": 33,
|
||||
"dislikes": 0,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
@@ -143,7 +143,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"8.2K\", \"totalAcceptedRaw\": 2856, \"totalSubmissionRaw\": 8213, \"acRate\": \"34.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"8.3K\", \"totalAcceptedRaw\": 2890, \"totalSubmissionRaw\": 8319, \"acRate\": \"34.7%\"}",
|
||||
"hints": [
|
||||
"We can try to determine the last digit of the answer, then divide everything by 2 and repeat."
|
||||
],
|
||||
|
Reference in New Issue
Block a user