待总结。。。。。。

    1. class Solution {
    2.     public int search(int[] nums, int target) {
    3.         int left = 0, right = nums.length;
    4.         while (left < right) {
    5.             if (nums.length == 0) {
    6.                 return -1;
    7.             }
    8.             int mid = left + (right - left) / 2;
    9.             if (target == nums[mid]) {
    10.                 return mid;
    11.             } else if (target > nums[mid]) {
    12.                 left = mid + 1;
    13.             } else if (target < nums[mid]) {
    14.                 right = mid;
    15.             }
    16.         }
    17.         return -1;
    18.     }
    19. }