Leetcode 744 Find Smallest Letter Greater Than Target（寻找比目标字母大的最小字母）

Find Smallest Letter Greater Than Target
Given a list of sorted characters letters containing only lowercase
letters, and given a target letter target, find the smallest element 
in the list that is larger than the given target.

Letters also wrap around. For example, if the target is target = 'z' and
letters = ['a', 'b'], the answer is 'a'.
Examples:
Input:
letters = ["c", "f", "j"]
target = "a"
Output: "c"

Input:
letters = ["c", "f", "j"]
target = "c"
Output: "f"

class Solution {
public:
    char nextGreatestLetter(vector<char>& letters, char target) {
        int size=letters.size();
        int left=0;
        int right=size-1;
        while(left<=right){
            int mid=(left+right)/2;
            if(target>=letters[mid]){
               left=mid+1;
            }
            if(target<letters[mid]){
                if(mid==0||(mid!=0&&letters[mid-1]<=target)){
                    return letters[mid];
                }
                else{
                    right=mid-1;
                }
            }
        }
        return letters[0];//找不到就返回第一个元素
    }//要拿target和letters[mid]做比较，要么target更大（不满足 要找比target更大的
      //更新范围）,如果mid的值比target更大那么就要对这个值展开讨论了
};