面试题 10.05. 稀疏数组搜索

class Solution {
public:
    int findString(vector<string>& words, string s) {
        int l=0,r=words.size()-1;
        while(l<r){
            int mid=l+r>>1;
            //找到离mid最近的一个非空字符串
            for(int i=1;i<r-l&&words[mid]=="";i++){
                if(mid-i>=l&&words[mid-i]!=""){
                    mid=mid-i;
                    break;
                }
                if(mid+i<=r&&words[mid+i]!=""){
                    mid=mid+i;
                    break;
                }
            }
            if(mid==l||mid==r)  break;
            if(words[mid]=="")  return -1;
            else if(words[mid]<s)   l=mid+1;
            else r=mid;
        }
        if(words[l]==s)   return l;
        if(words[r]==s)   return r;
        return -1;
    }
};