批量更新数据

leetcode-cn/problem (English)/数组归约运算(English) [array-reduce-transformation].html

@@ -1,8 +1,8 @@
-<p>Given an integer array&nbsp;<code>nums</code>, a reducer function&nbsp;<code>fn</code>, and an initial value&nbsp;<code>init</code>, return a&nbsp;<strong>reduced</strong>&nbsp;array.</p>
+<p>Given an integer array <code>nums</code>, a reducer function <code>fn</code>, and an initial value <code>init</code>, return the final result obtained by executing the <code>fn</code> function on each element of the array, sequentially, passing in the return value from the calculation on the preceding element.</p>
 
-<p>A&nbsp;<strong>reduced</strong>&nbsp;array is created by applying the following operation:&nbsp;<code>val = fn(init, nums[0])</code>, <code>val&nbsp;= fn(val, nums[1])</code>,&nbsp;<code>val&nbsp;= fn(val, nums[2])</code>,&nbsp;<code>...</code>&nbsp;until every element in the array has been processed. The final value of&nbsp;<code>val</code>&nbsp;is returned.</p>
+<p>This result is achieved through the following operations: <code>val = fn(init, nums[0]), val = fn(val, nums[1]), val = fn(val, nums[2]), ...</code> until every element in the array has been processed. The ultimate value of <code>val</code> is then returned.</p>
 
-<p>If the length of the array is 0, it should return&nbsp;<code>init</code>.</p>
+<p>If the length of the array is 0, the function should return <code>init</code>.</p>
 
 <p>Please solve it without using the built-in <code>Array.reduce</code> method.</p>
 
@@ -34,10 +34,10 @@ init = 100
 <strong>Output:</strong> 130
 <strong>Explanation:</strong>
 initially, the value is init=100.
-(100) + nums[0]^2 = 101
-(101) + nums[1]^2 = 105
-(105) + nums[2]^2 = 114
-(114) + nums[3]^2 = 130
+(100) + nums[0] * nums[0] = 101
+(101) + nums[1] * nums[1] = 105
+(105) + nums[2] * nums[2] = 114
+(114) + nums[3] * nums[3] = 130
 The final answer is 130.
 </pre>