From 59f449b22a3ed98774c119c8dfe76ac97776dbbe Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Fri, 15 Nov 2024 13:19:22 +0800
Subject: [PATCH] =?UTF-8?q?2024/11/15=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/Num2389.java | 31 +++++++++++++++++++
 1 file changed, 31 insertions(+)
 create mode 100644 src/main/java/com/cool/ling_cha_mount/binary_search/Num2389.java

diff --git a/src/main/java/com/cool/ling_cha_mount/binary_search/Num2389.java b/src/main/java/com/cool/ling_cha_mount/binary_search/Num2389.java
new file mode 100644
index 0000000..33b224c
--- /dev/null
+++ b/src/main/java/com/cool/ling_cha_mount/binary_search/Num2389.java
@@ -0,0 +1,31 @@
+package com.cool.ling_cha_mount.binary_search;
+
+import java.util.Arrays;
+
+public class Num2389 {
+    public int[] answerQueries(int[] nums, int[] queries) {
+        Arrays.sort(nums);
+        int[] res = new int[queries.length];
+        for (int i = 1; i < nums.length; i++) {
+            nums[i] += nums[i - 1];
+        }
+        for (int i = 0; i < queries.length; i++) {
+            res[i] = binarySearch(nums, queries[i] + 1);
+        }
+        return res;
+    }
+
+    private int binarySearch(int[] nums, int target) {
+        int left = 0;
+        int right = nums.length - 1;
+        while (left <= right) {
+            int mid = (right - left) / 2 + left;
+            if (target <= nums[mid]) {
+                right = mid - 1;
+            } else {
+                left = mid + 1;
+            }
+        }
+        return left;
+    }
+}