15 Jun 2024•C++ / Python / TypeScript•Easy

Search Insert Position

Collected C++, Python, TypeScript solutions for search insert position. Add a dedicated write-up later if you want deeper notes.

View original LeetCode question

auto-generated entry for Search Insert Position. the solution files are available below.

solution files

C++ search-insert-position/synced-solution.cpp
Python search-insert-position/synced-solution.py
TypeScript search-insert-position/synced-solution.ts

Solution files

Python•search-insert-position/synced-solution.py

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        lo, hi = class="syntax-number">0, len(nums)
        while lo < hi:
            mid = (lo + hi) class=class="syntax-string">"syntax-comment">// class="syntax-number">2
            if nums[mid] < target: lo = mid + class="syntax-number">1
            else: hi = mid
        return lo

C++•search-insert-position/synced-solution.cpp

class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int lo = class="syntax-number">0, hi = nums.size();
        while (lo < hi) {
            int mid = (lo+hi)/class="syntax-number">2;
            if (nums[mid] < target) lo = mid+class="syntax-number">1;
            else hi = mid;
        }
        return lo;
    }
};

TypeScript•search-insert-position/synced-solution.ts

function searchInsert(nums: number[], target: number): number {
    let lo = class="syntax-number">0, hi = nums.length;
    while (lo < hi) {
        const mid = (lo + hi) >> class="syntax-number">1;
        if (nums[mid] < target) lo = mid + class="syntax-number">1;
        else hi = mid;
    }
    return lo;
}