From 0dc0b1083520460692555a9ce056eea25417603e Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Mon, 11 Nov 2024 18:15:29 +0800
Subject: [PATCH] =?UTF-8?q?2024/11/11=20=E7=81=B5=E8=8C=B6=E9=A2=98?=
 =?UTF-8?q?=E5=8D=95=20=E4=BA=8C=E5=88=86=E6=9F=A5=E6=89=BE?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../ling_cha_mount/binary_search/Num744.java  | 35 +++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 src/main/java/com/cool/ling_cha_mount/binary_search/Num744.java

diff --git a/src/main/java/com/cool/ling_cha_mount/binary_search/Num744.java b/src/main/java/com/cool/ling_cha_mount/binary_search/Num744.java
new file mode 100644
index 0000000..987b538
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/binary_search/Num744.java
@@ -0,0 +1,35 @@
+package com.cool.ling_cha_mount.binary_search;
+
+import org.junit.Test;
+
+/**
+ * @author : Cool
+ * @date: 2024/11/11
+ */
+public class Num744 {
+    public char nextGreatestLetter(char[] letters, char target) {
+        int index=binarySearch(letters,(char)((int)target+1));
+        if(index<letters.length){
+            return letters[index];
+        }
+        return letters[0];
+    }
+
+    private int binarySearch(char[] letters,char target){
+        int left=0;
+        int right=letters.length-1;
+        while(left<=right){
+            int mid=(right-left)/2+left;
+            if(letters[mid]>=target){
+                right=mid-1;
+            }else{
+                left=mid+1;
+            }
+        }
+        return left;
+    }
+    @Test
+    public void test(){
+        nextGreatestLetter(new char[]{'c','f','j'},'c');
+    }
+}