반응형
1. 문제
https://leetcode.com/problems/binary-search/
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
2. 코드
/**
* @param {number[]} nums
* @param {number} target
* @return {number}
*/
var search = function(nums, target) {
return nums.indexOf(target);
};반응형
'리트코드 > easy' 카테고리의 다른 글
| [리트코드] 35. Search Insert Position - js (이진탐색) (0) | 2023.08.17 |
|---|---|
| [리트코드] 283. Move Zeroes - js (투포인터) (0) | 2023.08.17 |
| [리트코드] 169. Majority Element - js (해시) (0) | 2023.08.13 |
| [리트코드] 1. Two Sum - js (0) | 2023.08.10 |
| [리트코드] 345. Reverse Vowels of a String - js (0) | 2023.08.09 |