Example 1:
Input: [1,3,5,6], 5 Output: 2
Example 2:
Input: [1,3,5,6], 2 Output: 1
Example 3:
Input: [1,3,5,6], 7 Output: 4
Example 4:
Input: [1,3,5,6], 0 Output: 0
/** * @param {number[]} nums * @param {number} target * @return {number} */ var searchInsert = function(nums, target) { if(nums.indexOf(target) >=0){ return nums.indexOf(target); }else{ nums.push(target); nums.sort(function(a,b){ return a - b }); return nums.indexOf(target); } };
leetCode:35. Search Insert Position
原文：https://www.cnblogs.com/xiyu-8023/p/10437364.html