三刷33

Author: diguage

docs/0033-search-in-rotated-sorted-array.adoc

@@ -68,6 +68,15 @@ include::{sourcedir}/_0033_SearchInRotatedSortedArray.java[tag=answer]
 include::{sourcedir}/_0033_SearchInRotatedSortedArray_2.java[tag=answer]
 ----
 --
+
+三刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0033_SearchInRotatedSortedArray_3.java[tag=answer]
+----
+--
 ====
 
 == 参考资料

logbook/202503.adoc

@@ -160,6 +160,11 @@ endif::[]
 |{doc_base_url}/0005-longest-palindromic-substring.adoc[题解]
 |✅ 有更高效的马拉车算法，抽空可以尝试一下。
 
+|{counter:codes2503}
+|{leetcode_base_url}/search-in-rotated-sorted-array/[33. 搜索旋转排序数组^]
+|{doc_base_url}/0033-search-in-rotated-sorted-array.adoc[题解]
+|⭕️ 重点关注有序部分，优先在有序部分查找，不在有序部分再去无序部分查找。注意判定有序部分的方法： `nums[0]` 与 `nums[mid]` 相比较，而不是 `nums[left]`（它的值会来回变）。
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

src/main/java/com/diguage/algo/leetcode/_0033_SearchInRotatedSortedArray_3.java

@@ -0,0 +1,34 @@
+package com.diguage.algo.leetcode;
+
+public class _0033_SearchInRotatedSortedArray_3 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-04-06 14:59:46
+   */
+  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;
+      }
+      if (nums[0] <= nums[mid]) {
+        if (nums[left] <= target && target < nums[mid]) {
+          right = mid - 1;
+        } else {
+          left = mid + 1;
+        }
+      } else {
+        if (nums[mid] < target && target <= nums[right]) {
+          left = mid + 1;
+        } else {
+          right = mid - 1;
+        }
+      }
+    }
+    return -1;
+  }
+  // end::answer[]
+}