💻 Jihun's Ifuwanna IT :: Tech Blog 😃
이진검색 검색 결과

해당 글 4건

[LeetCode] 287. Find the Duplicate Number - 문제풀이

Description 주어진 배열에서 중복되는값 하나를 찾아 반환하는 문제입니다. Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and uses only constant extra space. Example 1: Input: nums = [1,3,4,2,2] Output: 2 Example 2: Input: nums = [..
알고리즘/LeetCode 2022. 3. 29. 15:41

[LeetCode] 81. Search in Rotated Sorted Array II - 문제풀이

Description 오름차순으로 정렬된 배열이 알수없는 수만큼 오른쪽으로 rotate된 배열이 있다고 가정할때 target값이 배열에 존재하는지 여부를 반환하는 문제입니다. There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values). Before being passed to your function, nums is rotated at an unknown pivot index k (0
알고리즘/LeetCode 2022. 3. 28. 13:09

[LeetCode] 278. First Bad Version - 문제풀이

Description 버전을 명시하는 정렬된 int 배열에서 특정 버전 이후는 모두 badVersion 을 나타내고 있을때 첫번째 badVersion을 나타내는 요소를 찾는 문제입니다. You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad. Suppose you have n versi..
알고리즘/LeetCode 2022. 1. 17. 13:08

[LeetCode] 704.Binary Search - 문제풀이

Description 정렬된 배열안에서 원하는 값을 찾는 문제입니다. 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. You must write an algorithm with O(log n) runtime complexity. Example 1: Input: nums = [-1,0,3,5,9,12], target = 9 Output: 4 Explanation: 9 exists in nums and its..
알고리즘/LeetCode 2022. 1. 17. 12:55