日常练习

Sunbeam-5 · Jun 9, 2022 · 765004a · 765004a
1 parent 80f7575
commit 765004a
Show file tree

Hide file tree

Showing 7 changed files with 57 additions and 0 deletions.
diff --git a/20030609/.idea/.gitignore b/20030609/.idea/.gitignore
diff --git a/20030609/.idea/misc.xml b/20030609/.idea/misc.xml
diff --git a/20030609/.idea/modules.xml b/20030609/.idea/modules.xml
diff --git a/20030609/.idea/vcs.xml b/20030609/.idea/vcs.xml
diff --git a/20030609/20030609.iml b/20030609/20030609.iml
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
diff --git a/20030609/out/production/20030609/二分查找.class b/20030609/out/production/20030609/二分查找.class
diff --git a/20030609/src/二分查找.java b/20030609/src/二分查找.java
@@ -0,0 +1,23 @@
+public class 二分查找 {
+    public static int binarySearch(int[] nums, int target) {
+        if (null == nums || nums.length == 0) { return -1; }
+
+        int left = 0;
+        int right = nums.length - 1;
+        while (left < right) {
+            int mid = (left + right) >> 1;
+            if (nums[mid] < target) {
+                left = mid + 1;
+            } else {
+                right = mid;
+            }
+        }
+        return nums[left] == target ? left : -1;
+    }
+
+    public static void main(String[] args) {
+        int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9};
+        int n = binarySearch(arr, 6);
+        System.out.println(n);
+    }
+}