From 0f081ad1dbef24fe1aba23e02020478552787a82 Mon Sep 17 00:00:00 2001
From: ehlxr <ehlxr.me@gmail.com>
Date: Sat, 1 Jan 2022 22:41:42 +0800
Subject: [PATCH] update at 2022-01-01 22:41:42 by ehlxr

---
 .../ehlxr/algorithm/search/BinarySearch.java  | 32 +++++++++++++++++++
 1 file changed, 32 insertions(+)

diff --git a/budd-common/src/main/java/io/github/ehlxr/algorithm/search/BinarySearch.java b/budd-common/src/main/java/io/github/ehlxr/algorithm/search/BinarySearch.java
index d9b8b31..52ca52e 100644
--- a/budd-common/src/main/java/io/github/ehlxr/algorithm/search/BinarySearch.java
+++ b/budd-common/src/main/java/io/github/ehlxr/algorithm/search/BinarySearch.java
@@ -33,6 +33,8 @@ public class BinarySearch {
         int[] a = new int[]{1, 3, 5, 6, 7, 8, 9};
         System.out.println(search(a, a.length, 3));
         System.out.println(searchRec(a, a.length, 3));
+        a = new int[]{1, 2, 2, 2, 2, 5, 6, 7, 8, 9};
+        System.out.println(searchFirst(a, a.length, 2));
     }
 
     /**
@@ -92,4 +94,34 @@ public class BinarySearch {
             return searchRec(a, low, mid - 1, v);
         }
     }
+
+    /**
+     * 查找第一个值等于给定值的元素
+     *
+     * @param a 要查找的数组
+     * @param n 数组的长度
+     * @param v 要查找的值
+     * @return 要查找值在数组中的索引
+     */
+    public static int searchFirst(int[] a, int n, int v) {
+        int low = 0;
+        int high = n - 1;
+        while (low <= high) {
+            int mid = low + (high - low) >> 1;
+            if (a[mid] == v) {
+                if (a[mid - 1] != v) {
+                    return mid;
+                } else {
+                    high = mid - 1;
+                }
+            }
+
+            if (a[mid] < v) {
+                low = mid + 1;
+            } else {
+                high = mid - 1;
+            }
+        }
+        return -1;
+    }
 }