[Easy] Title: 35. Search Insert Position - LeetCode

Author: JinHyung-dev

LeetCode/Easy/35. Search Insert Position/README.md

@@ -0,0 +1,36 @@
+# [Easy] 35. Search Insert Position
+
+[문제 링크](https://leetcode.com/problems/search-insert-position/)
+
+### 문제 설명
+Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.
+
+You must write an algorithm with `O(log n)` runtime complexity.
+
+### 입출력
+**Example 1:**
+
+```
+Input: nums = [1,3,5,6], target = 5
+Output: 2
+```
+
+**Example 2:**
+
+```
+Input: nums = [1,3,5,6], target = 2
+Output: 1
+```
+
+**Example 3:**
+
+```
+Input: nums = [1,3,5,6], target = 7
+Output: 4
+```
+
+### 제약조건
+- `1 <= nums.length <= 104`
+- `104 <= nums[i] <= 104`
+- `nums` contains **distinct** values sorted in **ascending** order.
+- `104 <= target <= 104`

LeetCode/Easy/35. Search Insert Position/Search Insert Position.java

@@ -0,0 +1,18 @@
+class Solution {
+    public int searchInsert(int[] nums, int target) {
+        int left = 0; int right = nums.length - 1;
+
+        while(left <= right) {
+            int mid = (left + right) / 2;
+
+            if(nums[mid] == target) {
+                return mid;
+            } else if(nums[mid] < target) {
+                left = mid + 1;
+            } else {
+                right = mid - 1;
+            }
+        }
+        return left;
+    }
+}