clueless coding // TODO: be smarter

LeetCode Search Insert Position: Java Solution



TL;DR Code Solution


public int searchInsert(int[] nums, int target) {

    int left = 0;
    int right = nums.length - 1;

    while (left <= right) {

        int middle = (left + right) / 2;

        if (nums[middle] == target) {
            left = middle;
            break;
        }
        else if (nums[middle] < target) {
            left = middle + 1;
        }
        else {
            right = middle - 1;
        }

    }

    return left;


}