From 85f8efeef6085920de4905787ae5773012e053a9 Mon Sep 17 00:00:00 2001
From: eeee0717 <chentao020717Work@outlook.com>
Date: Sun, 31 Dec 2023 09:35:51 +0800
Subject: [PATCH] =?UTF-8?q?Update1005.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=EF=BC=8C=E6=B7=BB=E5=8A=A0C#?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

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

diff --git a/problems/1005.K次取反后最大化的数组和.md b/problems/1005.K次取反后最大化的数组和.md
index bed11c7a..182402d2 100644
--- a/problems/1005.K次取反后最大化的数组和.md
+++ b/problems/1005.K次取反后最大化的数组和.md
@@ -322,6 +322,29 @@ object Solution {
 }
 ```
 
+### C#
+```csharp
+public class Solution
+{
+    public int LargestSumAfterKNegations(int[] nums, int k)
+    {
+        int res = 0;
+        Array.Sort(nums, (a, b) => Math.Abs(b) - Math.Abs(a));
+        for (int i = 0; i < nums.Length; i++)
+        {
+            if (nums[i] < 0 && k > 0)
+            {
+                nums[i] *= -1;
+                k--;
+            }
+        }
+        if (k % 2 == 1) nums[nums.Length - 1] *= -1;
+        foreach (var item in nums) res += item;
+        return res;
+    }
+}
+```
+
 
 
 <p align="center">