From 7baab96a2bde40f7d9406102cc0e27692d4b2051 Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Fri, 11 Oct 2024 20:19:47 +0800
Subject: [PATCH] =?UTF-8?q?2024/10/11=20=E7=81=B5=E8=8C=B6=E9=A2=98?=
 =?UTF-8?q?=E5=8D=95=20=E6=BB=91=E5=8A=A8=E7=AA=97=E5=8F=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../sliding_windows/Num1423.java              | 56 +++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1423.java

diff --git a/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1423.java b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1423.java
new file mode 100644
index 0000000..7143b51
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num1423.java
@@ -0,0 +1,56 @@
+package com.cool.ling_cha_mount.sliding_windows;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @Author: Cool
+ * @Date: 2024/10/11/20:12
+ * @Description: 1423. 可获得的最大点数
+ * Level 4
+ * Score 1574
+ * Hard 2
+ */
+public class Num1423 {
+
+    /**
+     * @Author Cool
+     * @Date 20:19 2024/10/11
+     * 反向思维
+     **/
+    public int maxScore(int[] cardPoints, int k) {
+        int sum = 0;
+        int allSum =0;
+        int len = cardPoints.length;
+        int res = Integer.MAX_VALUE;
+        for (int i = 0; i < len - k; i++) {
+            allSum+=cardPoints[i];
+            sum += cardPoints[i];
+        }
+        res = Math.min(sum, res);
+        for (int i = len - k; i < len; i++) {
+            sum += cardPoints[i];
+            allSum+=cardPoints[i];
+            sum -= cardPoints[i - (len - k)];
+            res = Math.min(sum, res);
+        }
+        return allSum - res;
+    }
+    /**
+     * @Author Cool
+     * @Date 20:19 2024/10/11
+     * 正向思维
+     **/
+    public int maxScore1(int[] cardPoints, int k) {
+        int sum=0;
+        for(int i=0;i<k;i++){
+            sum+=cardPoints[i];
+        }
+        int res=Math.max(0,sum);
+        for(int i=0;i<k;i++){
+            sum+=cardPoints[cardPoints.length-i-1];
+            sum-=cardPoints[k-i-1];
+            res=Math.max(res,sum);
+        }
+        return res;
+    }
+}