PS/LeetCode
LeetCode / Binary Search / 704번 / Binary Search / JS
KimMinJun
2023. 4. 5. 16:08
Binary Search - LeetCode
Can you solve this real interview question? Binary Search - Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1.
leetcode.com
< 문제 간단설명 >
주어진 nums 배열에서 target의 값이 몇번째 인덱스에 존재하는지 이분탐색으로 찾는 문제이다.
/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var search = function(nums, target) {
let left = 0;
let right = nums.length - 1;
let mid = 0;
while(left <= right) {
mid = Math.floor((left + right) / 2);
if(nums[mid] < target) {
left = mid + 1;
}
if(nums[mid] > target) {
right = mid - 1;
}
if(nums[mid] === target) {
return mid;
}
}
return -1;
};