2022-08-25

[gongpeione]

704 Binary Search

/*
 * @lc app=leetcode id=704 lang=typescript
 *
 * [704] Binary Search
 */

// @lc code=start
function search(nums: number[], target: number): number {
    let right = nums.length - 1;
    let left = 0;

    while (right >= left) {
        const middle = left + ~~((right - left) / 2)
        if (nums[middle] > target) {
            right = middle - 1;
        } else if (nums[middle] < target) {
            left = middle + 1;
        } else {
            return middle
        }
    }

    return -1;
};
// @lc code=end

---

Nickname: Geeku From vscode-hzfe-algorithms

[Akiq2016]

// @lc code=start
/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number[]}
 */
var twoSum = function (nums, target) {
  const map = {};
  let res = [];
  let index = 0;
  while (index < nums.length) {
    const another = target - nums[index];
    if (map[another] !== undefined && map[another] !== index) {
      res = [index, map[another]];
      break;
    } else {
      map[nums[index]] = index;
    }
    index++;
  }
  return res;
};
// @lc code=end