목록2023/07/05 (1)

잡다한 IT 지식

[LeetCode] - 35. Search Insert Position

문제 출처 : https://leetcode.com/problems/search-insert-position/description/ [문제 설명] The array is sorted. so you can use a binary search algorithm, not a linear search. the time complexity of a linear search is O(N) but a binary search is O(logN). (N is the size of the array) The given array has consisted of distinct integers. So if you find a target's index then you should return the index. if you..
알고리즘 문제 풀이/이분탐색 2023. 7. 5. 21:58
이전 Prev 1 Next 다음