| [ Web Proxy ] |
| Viewing: https://raw.githubusercontent.com/feixiangcode/algorithm/master/Week_01/id_118/leetcode_33_118.java | [Back] [Original] |
/**
* https://leetcode-cn.com/problems/search-in-rotated-sorted-array/
*/
class Solution {
public int search(int[] A, int target) {
//
//
if(A.length= > left=mid left=mid+1
while(left A[mid] && target=A[left] && target
| Web Proxy Viewer | New URL | Original Page |