[leetcode 33] Search in Rotated Sorted Array
You are given an integer array nums sorted in ascending order, and an integer target. Suppose that nums is rotated at some pivot unknown to you beforehand (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). If target is found in the array return its index, otherwise, return -1. 본래 오름차순인 배열이 특정 위치를 중심으로 회전되어 있다. 주어진 target의 위치를 찾아라. Example 1: Input: nums = [4,5,6,7,0,1,2], target = 0 Output: 4..
2020. 10. 17.