/* *@lc app=leetcode id=35 lang=javascript * * [35] Search Insert Position *//** *@param {number[]} nums *@param {number} target *@return {number} */varsearchInsert=function(nums,target){};

/* * @lc app=leetcode id=35 lang=javascript * * [35] Search Insert Position *//** * @param {number[]} nums * @param {number} target * @return {number} */var searchInsert = function(nums, target) {    };[35] Search Insert Position  https://leetcode.com/problems/search-insert-position/description/Tags:   algorithms   array   binary-search Langs:  c   cpp   csharp   golang   java   javascript   kotlin   php   python   python3   ruby   rust   scala   swift * algorithms* Easy (40.67%)* Likes:    1225* Dislikes: 170* Total Accepted:    386.1K* Total Submissions: 948.8K* Testcase Example:  '[1,3,5,6]\n5'<p>Given a sorted array 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.</p><p>You may assume no duplicates in the array.</p><p><strong>Example 1:</strong></p><pre><strong>Input:</strong> [1,3,5,6], 5<strong>Output:</strong> 2</pre><p><strong>Example 2:</strong></p><pre><strong>Input:</strong> [1,3,5,6], 2<strong>Output:</strong> 1</pre><p><strong>Example 3:</strong></p><pre><strong>Input:</strong> [1,3,5,6], 7<strong>Output:</strong> 4</pre><p><strong>Example 4:</strong></p><pre><strong>Input:</strong> [1,3,5,6], 0<strong>Output:</strong> 0</pre>

{"leetcode.defaultLanguage":"javascript","leetcode.showLocked":true,"leetcode.enableStatusBar":false,"leetcode.enableShortcuts":false}