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

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

diff --git a/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num2779.java b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num2779.java
new file mode 100644
index 0000000..71293b3
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/sliding_windows/Num2779.java
@@ -0,0 +1,28 @@
+package com.cool.ling_cha_mount.sliding_windows;
+
+import java.util.Arrays;
+
+/**
+ * Created with IntelliJ IDEA.
+ *
+ * @Author: Cool
+ * @Date: 2024/10/23/23:48
+ * @Description: 2779. 数组的最大美丽值
+ * Score 1638
+ */
+public class Num2779 {
+    public int maximumBeauty(int[] nums, int k) {
+        Arrays.sort(nums);
+        int left=0;
+        int res=0;
+        for(int i=0;i<nums.length;i++){
+            if((nums[i]-2*k)>nums[left]){
+                res=Math.max(res,i-left);
+                while(nums[i]-2*k>nums[++left]){
+
+                }
+            }
+        }
+        return Math.max(res,nums.length-left);
+    }
+}