LeetCode: Search in Rotated Sorted Array

少数次过

class Solution {
public:
    int search(int A[], int n, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int left, right, mid;
        left = 0, right = n-1;
        while (left <= right) {
            mid = (left+right)/2;
            if (target < A[0] && A[mid] >= A[0]) {
                left = mid + 1;
                continue;
            }
            if (target >= A[0] && A[mid] < A[0]) {
                right = mid - 1;
                continue;
            }
            if (target < A[mid]) right = mid-1;
            else left = mid+1;
        }
        return target == A[(left+right)/2]? (left+right)/2 : -1;
    }
};

 C#

public class Solution {
    public int Search(int[] nums, int target) {
        int left = 0, right = nums.Length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (target < nums[0] && nums[mid] >= nums[0]) {
                left = mid + 1;
                continue;
            }
            if (target >= nums[0] && nums[mid] < nums[0]) {
                right = mid - 1;
                continue;
            }
            if (target < nums[mid]) right = mid - 1;
            else left = mid + 1;
        }
        return target == nums[(left + right) / 2]? (left + right) / 2 : -1;
    }
}