From 411ef134a7e194e281affa0be45efe9bbcad4a25 Mon Sep 17 00:00:00 2001
From: fw_qaq <fwqaaq@gmail.com>
Date: Tue, 14 Mar 2023 12:33:05 +0800
Subject: [PATCH] =?UTF-8?q?Update=201005.K=E6=AC=A1=E5=8F=96=E5=8F=8D?=
 =?UTF-8?q?=E5=90=8E=E6=9C=80=E5=A4=A7=E5=8C=96=E7=9A=84=E6=95=B0=E7=BB=84?=
 =?UTF-8?q?=E5=92=8C.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...1005.K次取反后最大化的数组和.md | 21 +++++++------------
 1 file changed, 8 insertions(+), 13 deletions(-)

diff --git a/problems/1005.K次取反后最大化的数组和.md b/problems/1005.K次取反后最大化的数组和.md
index cdf42511..439bdfde 100644
--- a/problems/1005.K次取反后最大化的数组和.md
+++ b/problems/1005.K次取反后最大化的数组和.md
@@ -231,23 +231,18 @@ var largestSumAfterKNegations = function(nums, k) {
 
 ```Rust
 impl Solution {
-    pub fn largest_sum_after_k_negations(nums: Vec<i32>, k: i32) -> i32 {
-        let mut nums = nums;
-        let mut k = k;
-        let len = nums.len();
-        nums.sort_by(|a, b| b.abs().cmp(&a.abs()));
-        for i in 0..len {
-            if nums[i] < 0 && k > 0 {
-                nums[i] *= -1;
+    pub fn largest_sum_after_k_negations(mut nums: Vec<i32>, mut k: i32) -> i32 {
+        nums.sort_by_key(|b| std::cmp::Reverse(b.abs()));
+        for v in nums.iter_mut() {
+            if *v < 0 && k > 0 {
+                *v *= -1;
                 k -= 1;
             }
         }
-        if k % 2 == 1 { nums[len - 1] *= -1; }
-        let mut result = 0;
-        for num in nums {
-            result += num;
+        if k % 2 == 1 {
+            *nums.last_mut().unwrap() *= -1;
         }
-        result
+        nums.iter().sum()
     }
 }
 ```