From 4584dd083e8692b1db85de953f2441c9dbf365e6 Mon Sep 17 00:00:00 2001
From: huangge1199 <huangge1199@hotmail.com>
Date: Tue, 6 Jul 2021 17:02:26 +0800
Subject: [PATCH] =?UTF-8?q?35:=E6=90=9C=E7=B4=A2=E6=8F=92=E5=85=A5?=
 =?UTF-8?q?=E4=BD=8D=E7=BD=AE?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../editor/cn/SearchInsertPosition.java       | 62 +++++++++++++++++++
 .../editor/cn/SearchInsertPosition.md         | 28 +++++++++
 2 files changed, 90 insertions(+)
 create mode 100644 src/main/java/leetcode/editor/cn/SearchInsertPosition.java
 create mode 100644 src/main/java/leetcode/editor/cn/SearchInsertPosition.md

diff --git a/src/main/java/leetcode/editor/cn/SearchInsertPosition.java b/src/main/java/leetcode/editor/cn/SearchInsertPosition.java
new file mode 100644
index 0000000..2efab7f
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/SearchInsertPosition.java
@@ -0,0 +1,62 @@
+//给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。 
+//
+// 你可以假设数组中无重复元素。 
+//
+// 示例 1: 
+//
+// 输入: [1,3,5,6], 5
+//输出: 2
+// 
+//
+// 示例 2: 
+//
+// 输入: [1,3,5,6], 2
+//输出: 1
+// 
+//
+// 示例 3: 
+//
+// 输入: [1,3,5,6], 7
+//输出: 4
+// 
+//
+// 示例 4: 
+//
+// 输入: [1,3,5,6], 0
+//输出: 0
+// 
+// Related Topics 数组 二分查找 
+// 👍 953 👎 0
+
+package leetcode.editor.cn;
+
+//35:搜索插入位置
+public class SearchInsertPosition {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new SearchInsertPosition().new Solution();
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public int searchInsert(int[] nums, int target) {
+            int length = nums.length;
+            int start = 0;
+            int end = length - 1;
+            int result = length;
+            while (start <= end) {
+                int mid = (end - start) / 2 + start;
+                if (target <= nums[mid]) {
+                    result = mid;
+                    end = mid - 1;
+                } else {
+                    start = mid + 1;
+                }
+            }
+            return result;
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/SearchInsertPosition.md b/src/main/java/leetcode/editor/cn/SearchInsertPosition.md
new file mode 100644
index 0000000..8679a57
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/SearchInsertPosition.md
@@ -0,0 +1,28 @@
+<p>给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。</p>
+
+<p>你可以假设数组中无重复元素。</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入:</strong> [1,3,5,6], 5
+<strong>输出:</strong> 2
+</pre>
+
+<p><strong>示例&nbsp;2:</strong></p>
+
+<pre><strong>输入:</strong> [1,3,5,6], 2
+<strong>输出:</strong> 1
+</pre>
+
+<p><strong>示例 3:</strong></p>
+
+<pre><strong>输入:</strong> [1,3,5,6], 7
+<strong>输出:</strong> 4
+</pre>
+
+<p><strong>示例 4:</strong></p>
+
+<pre><strong>输入:</strong> [1,3,5,6], 0
+<strong>输出:</strong> 0
+</pre>
+<div><div>Related Topics</div><div><li>数组</li><li>二分查找</li></div></div>\n<div><li>👍 953</li><li>👎 0</li></div>
\ No newline at end of file