二刷704

Author: diguage

docs/0704-binary-search.adoc

@@ -35,11 +35,29 @@ Given a *sorted* (in ascending order) integer array `nums` of `n` elements and a
 
 image::images/0704-01.gif[{image_attr}]
 
+image::images/0704-02.gif[{image_attr}]
+
 [[src-0704]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0704_BinarySearch.java[tag=answer]
 ----
+--
+
+二刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0704_BinarySearch_2.java[tag=answer]
+----
+--
+====
 
 == 参考资料
 

docs/images/0704-02.gif

@@ -560,6 +560,11 @@
 |{doc_base_url}/0054-spiral-matrix.adoc[题解]
 |从回溯得到启发，使用递归来完成层次的遍历。
 
+|{counter:codes}
+|{leetcode_base_url}/binary-search/[704. Binary Search^]
+|{doc_base_url}/0704-binary-search.adoc[题解]
+|二分查找
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

logbook/202406.adoc

@@ -0,0 +1,24 @@
+package com.diguage.algo.leetcode;
+
+public class _0704_BinarySearch_2 {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-14 19:52:26
+   */
+  public int search(int[] nums, int target) {
+    int left = 0, right = nums.length - 1;
+    while (left <= right) {
+      int mid = left + (right - left) / 2;
+      if (nums[mid] == target) {
+        return mid;
+      } else if (nums[mid] < target) {
+        left = mid + 1;
+      } else {
+        right = mid - 1;
+      }
+    }
+    return -1;
+  }
+  // end::answer[]
+}