[230829] Leetcode - 35

Leetcode - 108

• 35. Search Insert Position
• 재귀함수 사용해서 품 ```js /**
• @param {number[]} nums
• @param {number} target

• @return {number} */ var searchInsert = function (nums, target) { const bst = (s, e) => { const mid = Math.ceil((s + e) / 2);

  if (e <= s) { if (nums[s] < target) return mid + 1; else return mid; }

  if (nums[mid] === target) return mid; else if (nums[mid] > target) return bst(0, mid - 1); else return bst(mid + 1, e); };

return bst(0, nums.length - 1); }; ```