1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>输入一个递增排序的数组和一个数字s在数组中查找两个数使得它们的和正好是s。如果有多对数字的和等于s则输出任意一对即可。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1</strong></p>\n\n<pre><strong>输入:</strong>nums = [2,7,11,15], target = 9\n<strong>输出:</strong>[2,7] 或者 [7,2]\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre><strong>输入:</strong>nums = [10,26,30,31,47,60], target = 40\n<strong>输出:</strong>[10,30] 或者 [30,10]\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>限制:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= nums.length &lt;= 10^5</code></li>\n\t<li><code>1 &lt;= nums[i]&nbsp;&lt;= 10^6</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 171,
"likes": 173,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"181K\", \"totalSubmission\": \"268K\", \"totalAcceptedRaw\": 180965, \"totalSubmissionRaw\": 268038, \"acRate\": \"67.5%\"}",
"stats": "{\"totalAccepted\": \"181.7K\", \"totalSubmission\": \"269.1K\", \"totalAcceptedRaw\": 181717, \"totalSubmissionRaw\": 269142, \"acRate\": \"67.5%\"}",
"hints": [],
"solution": null,
"status": null,