35. Search Insert Position

```Solution.c int searchInsert(int* nums, int numsSize, int target) { int left = 0, right = numsSize - 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 left; } ``` ```Solution.cpp class Solution { public: int searchInsert(vector<int>& nums, int target) { int left = 0, right = nums.size() - 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 left; } }; ``` ```Solution.cs public class Solution { public int SearchInsert(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 left; } } ``` ```Solution.dart class Solution { int searchInsert(List<int> nums, int target) { int left = 0, 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; } } ``` ```Solution.erl -spec search_insert([integer()], integer()) -> integer(). search_insert(Nums, Target) -> search(Nums, Target, 0, length(Nums) - 1). search(Nums, Target, Left, Right) when Left =< Right -> Mid = (Left + Right) div 2, Val = lists:nth(Mid + 1, Nums), case Val of Target -> Mid; _ when Val < Target -> search(Nums, Target, Mid + 1, Right); _ -> search(Nums, Target, Left, Mid - 1) end; search(_, _, Left, _) -> Left. ``` ```Solution.ex defmodule Solution do @SPEC search_insert(nums :: [integer], target :: integer) :: integer def search_insert(nums, target) do search(nums, target, 0, length(nums) - 1) end defp search(nums, target, left, right) when left <= right do mid = div(left + right, 2) val = Enum.at(nums, mid) cond do val == target -> mid val < target -> search(nums, target, mid + 1, right) true -> search(nums, target, left, mid - 1) end end defp search(_nums, _target, left, _right), do: left end ``` ```Solution.go func searchInsert(nums []int, target int) int { left, right := 0, len(nums)-1 for left <= right { mid := (left + right) / 2 if nums[mid] == target { return mid } else if nums[mid] < target { left = mid + 1 } else { right = mid - 1 } } return left } ``` ```Solution.java class Solution { public int searchInsert(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 left; } } ``` ```Solution.js /** * @param {number[]} nums * @param {number} target * @return {number} */ var searchInsert = function(nums, target) { let left = 0, right = nums.length - 1; while (left <= right) { let mid = Math.floor((left + right) / 2); if (nums[mid] === target) return mid; else if (nums[mid] < target) left = mid + 1; else right = mid - 1; } return left; }; ``` ```Solution.kt class Solution { fun searchInsert(nums: IntArray, target: Int): Int { var left = 0 var right = nums.size - 1 while (left <= right) { val mid = left + (right - left) / 2 if (nums[mid] == target) return mid else if (nums[mid] < target) left = mid + 1 else right = mid - 1 } return left } } ``` ```Solution.php class Solution { /** * @param Integer[] $nums * @param Integer $target * @return Integer */ function searchInsert($nums, $target) { $left = 0; $right = count($nums) - 1; while ($left <= $right) { $mid = intdiv($left + $right, 2); if ($nums[$mid] == $target) return $mid; elseif ($nums[$mid] < $target) $left = $mid + 1; else $right = $mid - 1; } return $left; } } ``` ```Solution.py class Solution: def searchInsert(self, nums: List[int], target: int) -> int: left, right = 0, len(nums) - 1 while left <= right: mid = (left + right) // 2 if nums[mid] == target: return mid elif nums[mid] < target: left = mid + 1 else: right = mid - 1 return left ``` ```Solution.rb # @param {Integer[]} nums # @param {Integer} target # @return {Integer} def search_insert(nums, target) left, right = 0, nums.length - 1 while left <= right mid = (left + right) / 2 if nums[mid] == target return mid elsif nums[mid] < target left = mid + 1 else right = mid - 1 end end left end ``` ```Solution.rkt (define (search-insert nums target) (let loop ((left 0) (right (- (length nums) 1))) (if (> left right) left (let* ((mid (quotient (+ left right) 2)) (val (list-ref nums mid))) (cond [(= val target) mid] [(< val target) (loop (+ mid 1) right)] [else (loop left (- mid 1))]))))) ``` ```Solution.rs impl Solution { pub fn search_insert(nums: Vec<i32>, target: i32) -> i32 { let mut left = 0; let mut right = nums.len() as i32 - 1; while left <= right { let mid = left + (right - left) / 2; if nums[mid as usize] == target { return mid; } else if nums[mid as usize] < target { left = mid + 1; } else { right = mid - 1; } } left } } ``` ```Solution.scala object Solution { def searchInsert(nums: Array[Int], target: Int): Int = { var left = 0 var right = nums.length - 1 while (left <= right) { val mid = left + (right - left) / 2 if (nums(mid) == target) return mid else if (nums(mid) < target) left = mid + 1 else right = mid - 1 } left } } ``` ```Solution.swift class Solution { func searchInsert(_ nums: [Int], _ target: Int) -> Int { var left = 0, right = nums.count - 1 while left <= right { let mid = (left + right) / 2 if nums[mid] == target { return mid } else if nums[mid] < target { left = mid + 1 } else { right = mid - 1 } } return left } } ``` ```Solution.ts function searchInsert(nums: number[], target: number): number { let left = 0, right = nums.length - 1; while (left <= right) { let mid = Math.floor((left + right) / 2); if (nums[mid] === target) return mid; else if (nums[mid] < target) left = mid + 1; else right = mid - 1; } return left; } ```

Author: nendroids

sol/solution/0001-0100/0035/README.md

@@ -0,0 +1,29 @@
+# [**35. Search Insert Position**](https://leetcode.com/problems/search-insert-position/description/)
+
+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:**
+```md
+Input: nums = [1,3,5,6], target = 5
+Output: 2
+```
+
+#### **Example 2:**
+```md
+Input: nums = [1,3,5,6], target = 2
+Output: 1
+```
+
+#### **Example 3:**
+```md
+Input: nums = [1,3,5,6], target = 7
+Output: 4
+```
+
+#### **Constraints:**
+> - `1 <= nums.length <= 10⁴`
+> - `-10⁴ <= nums[i] <= 10⁴`
+> - `nums` contains **distinct** values sorted in **ascending** order.
+> - `-10⁴ <= target <= 10⁴`

sol/solution/0001-0100/0035/Solution.c

@@ -0,0 +1,10 @@
+int searchInsert(int* nums, int numsSize, int target) {
+ int left = 0, right = numsSize - 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 left;
+}

sol/solution/0001-0100/0035/Solution.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+ int searchInsert(vector<int>& nums, int target) {
+ int left = 0, right = nums.size() - 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 left;
+ }
+};

sol/solution/0001-0100/0035/Solution.cs

@@ -0,0 +1,12 @@
+public class Solution {
+ public int SearchInsert(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 left;
+ }
+}

sol/solution/0001-0100/0035/Solution.dart

@@ -0,0 +1,12 @@
+class Solution {
+ int searchInsert(List<int> nums, int target) {
+ int left = 0, 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;
+ }
+}

sol/solution/0001-0100/0035/Solution.erl

@@ -0,0 +1,13 @@
+-spec search_insert([integer()], integer()) -> integer().
+search_insert(Nums, Target) ->
+ search(Nums, Target, 0, length(Nums) - 1).
+search(Nums, Target, Left, Right) when Left =< Right ->
+ Mid = (Left + Right) div 2,
+ Val = lists:nth(Mid + 1, Nums),
+ case Val of
+ Target -> Mid;
+ _ when Val < Target -> search(Nums, Target, Mid + 1, Right);
+ _ -> search(Nums, Target, Left, Mid - 1)
+ end;
+search(_, _, Left, _) ->
+ Left.

sol/solution/0001-0100/0035/Solution.ex

@@ -0,0 +1,16 @@
+defmodule Solution do
+ @spec search_insert(nums :: [integer], target :: integer) :: integer
+ def search_insert(nums, target) do
+ search(nums, target, 0, length(nums) - 1)
+ end
+ defp search(nums, target, left, right) when left <= right do
+ mid = div(left + right, 2)
+ val = Enum.at(nums, mid)
+ cond do
+ val == target -> mid
+ val < target -> search(nums, target, mid + 1, right)
+ true -> search(nums, target, left, mid - 1)
+ end
+ end
+ defp search(_nums, _target, left, _right), do: left
+end

sol/solution/0001-0100/0035/Solution.go

@@ -0,0 +1,14 @@
+func searchInsert(nums []int, target int) int {
+ left, right := 0, len(nums)-1
+ for left <= right {
+ mid := (left + right) / 2
+ if nums[mid] == target {
+ return mid
+ } else if nums[mid] < target {
+ left = mid + 1
+ } else {
+ right = mid - 1
+ }
+ }
+ return left
+}

sol/solution/0001-0100/0035/Solution.java

@@ -0,0 +1,12 @@
+class Solution {
+ public int searchInsert(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 left;
+ }
+}

sol/solution/0001-0100/0035/Solution.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number}
+ */
+var searchInsert = function(nums, target) {
+ let left = 0, right = nums.length - 1;
+ while (left <= right) {
+ let mid = Math.floor((left + right) / 2);
+ if (nums[mid] === target) return mid;
+ else if (nums[mid] < target) left = mid + 1;
+ else right = mid - 1;
+ }
+ return left;
+};