2021/09/01 글 목록

[LeetCode - Daily Challenge] 153. Find Minimum in Rotated Sorted Array

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [4,5,6,7,0,1,2] if it was rotated 4 times. [0,1,2,4,5,6,7] if it was rotated 7 times. Notice that rotating an array [a[0], a[1], a[2], ..., a[n-1]] 1 time results in the array [a[n-1], a[0], a[1], a[2], ..., a[n-..

Algorithm/LeetCode Daily Challenge 2021. 9. 1. 10:40

이전 1 다음

이전 다음

공지사항

최근에 올라온 글