Cracking The Coding Interview 9.6

//原文:
//
//	Given a sorted array of strings which is interspersed with empty strings, write a method to find the location of a given string.
//
//Example: find “ball” in [“at”, “”, “”, “”, “ball”, “”, “”, “car”, “”,“”, “dad”, “”, “”] will return 4
//
//Example: find “ballcar” in [“at”, “”, “”, “”, “”, “ball”, “car”, “”, “”, “dad”, “”, “”] will return -1

#include <iostream>
#include <string>
using namespace std;
int search(string a[],int begin, int end, string key)
{
	while(begin < end)
	{
		int mid = (begin + end)/2;
		while(a[mid] =="" && mid<= end)
		{
			mid++;
		}

		if (a[mid] == key)
		{
			return mid;
		}
		if (key > a[mid])
		{
			begin = mid +1;
		}
		else
		{
			end = mid -1;
		}
	}
	return -1;
}

int main()
{
	string a[13] = {"at","", "","","ball","","","car","","","dad","",""};
	cout<<search(a,0,12,"ball")<<endl;
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值