From fcc6fec02415994ebdc7142f1a551d2259c8d891 Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Tue, 12 Nov 2024 18:52:23 +0800
Subject: [PATCH] =?UTF-8?q?2024/11/12=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

---
 .../java/com/cool/ling_cha_mount/binary_search/Num2529.java | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/src/main/java/com/cool/ling_cha_mount/binary_search/Num2529.java b/src/main/java/com/cool/ling_cha_mount/binary_search/Num2529.java
index d537324..346b75d 100644
--- a/src/main/java/com/cool/ling_cha_mount/binary_search/Num2529.java
+++ b/src/main/java/com/cool/ling_cha_mount/binary_search/Num2529.java
@@ -7,6 +7,12 @@ import org.junit.Test;
  * @date: 2024/11/12
  */
 public class Num2529 {
+    /**
+     * @Author Cool
+     * @Date 18:50 2024/11/12
+     * 找到第一个0，若存在则找最后一个0的位置，类似于<a herf="https://leetcode.cn/problems/find-first-and-last-position-of-element-in-sorted-array/description/"/>
+     * 若找不到0，则可能是数组内所有数字都小于0，或是不存在0，则进行分类讨论
+     **/
     public int maximumCount(int[] nums) {
         int start = binarySearch(nums, 0);
         if (start < nums.length && nums[start] == 0) {