mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-12 19:01:47 +08:00
批量更新数据
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
<pre>
|
||||
<strong>输入:</strong>nums = [-1,2,1,-4], target = 1
|
||||
<strong>输出:</strong>2
|
||||
<strong>解释:</strong>与 target 最接近的和是 2 (-1 + 2 + 1 = 2) 。
|
||||
<strong>解释:</strong>与 target 最接近的和是 2 (-1 + 2 + 1 = 2)。
|
||||
</pre>
|
||||
|
||||
<p><strong>示例 2:</strong></p>
|
||||
@@ -19,7 +19,7 @@
|
||||
<pre>
|
||||
<strong>输入:</strong>nums = [0,0,0], target = 1
|
||||
<strong>输出:</strong>0
|
||||
</pre>
|
||||
<strong>解释:</strong>与 target 最接近的和是 0(0 + 0 + 0 = 0)。</pre>
|
||||
|
||||
<p> </p>
|
||||
|
||||
|
Reference in New Issue
Block a user