给定一个有序字符串数组,其中字符串两边可能会插入若干个空串。实现一个方法找到给定串的下标。
例子:
输入:[ "at", "", "", "", "ball", "", "", "car", "", "", "dad", "", "" ],"ball"输出:4
输入:[ "at", "", "", "", "ball", "", "", "car", "", "", "dad", "", "" ],"ballcar"输出:-1
思路:
用二分查找的思想,但要针对空串做些额外的处理。用left、mid、right分表表示数组的左、中、右。如果right对应的串为空串,继续向前扫描直到找到第一个非空串,然后求mid的值,如果mid对应的串为空串,继续向右扫描直到找到第一个非空串(因为right对应的非空串,所以mid最后一定会对应一个非空串),然后进行比较,以此类推。当然也可以从left开始扫描直到找到第一个非空串,然后求mid,如果mid对应的串为空串,继续向左扫描直到找到第一个非空串。
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int FindString(const vector<string>& svec, const string& s)
{
int left = 0, right = svec.size() - 1;
int mid;
while (left <= right)
{
while (left <= right && svec[right].size() == 0)
--right;
if (right < left)
return -1;
mid = left + ((right - left) >> 1);
while (svec[mid].size() == 0)
++mid;
int res = s.compare(svec[mid]);
if (res == 0)
return mid;
else if (res < 0)
right = mid - 1;
else
left = mid + 1;
}
return -1;
}
int main()
{
vector<string> svec;
svec.push_back("at");
svec.push_back("");
svec.push_back("");
svec.push_back("");
svec.push_back("ball");
svec.push_back("");
svec.push_back("");
svec.push_back("car");
svec.push_back("");
svec.push_back("");
svec.push_back("dad");
svec.push_back("");
svec.push_back("");
string t("ball");
string s("ballcar");
cout << FindString(svec, t) << endl;
cout << FindString(svec, s) << endl;
return 0;
}