题目:
给定一个只包含小写字母的有序数组letters 和一个目标字母 target,寻找有序数组里面比目标字母大的最小字母。
在比较时,数组里字母的是循环有序的。举个例子:
如果目标字母 target = ‘z’ 并且有序数组为 letters = [‘a’, ‘b’],则答案返回 ‘a’。
如果目标字母 target = ‘n’ 并且有序数组为 letters = [‘m’, ‘z’, ‘c’, ‘f’, ‘j’] ,则答案返回 ‘z’ 。
示例:
输入:
letters = [“c”, “f”, “j”]
target = “a”
输出: “c”
输入:
letters = [“c”, “f”, “j”]
target = “c”
输出: “f”
输入:
letters = [“c”, “f”, “j”]
target = “d”
输出: “f”
输入:
letters = [“c”, “f”, “j”]
target = “g”
输出: “j”
输入:
letters = [“c”, “f”, “j”]
target = “j”
输出: “c”
输入:
letters = [“c”, “f”, “j”]
target = “k”
输出: “c”
思路:
根据二分法模板稍加修改即可
二分法模板:
//x:待查找的元素, n:数组集合大小, num数组单调递增
int low=0,high=n,mid,res = -1; //low:集合下界 high:集合上节
while(low<=high)
{
mid=(low+high)/2; //mid:将集合分割为两部分
if(num[mid]==x) //查找到符合元素x
{
res = mid;
break;
}
else if(num[mid]<x)//x在右边部分,调整集合下界
low=mid+1;
else //x在左边部分,调整集合上界
high=mid-1;
}//若未找到x,则res = -1
执行用时和内存消耗:
解题代码:
//只需提交nextGreatestLetter()内部代码即可,main函数用来测试。
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
//根据二分法模板稍加修改即可
char nextGreatestLetter(vector<char>& letters, char target) {
int low = 0, high = letters.size() - 1, mid;
while (low <= high)//若最后存在,则l一定指向答案;
{
mid = (low + high) / 2;
if (letters[mid] <= target)
low = mid + 1;
else
high = mid - 1;
}
if (low < letters.size()) {
return letters[low];
}
else {
return letters[0];
}
}
int main() {
vector<char> letters;
char target,tp;
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tp;
letters.push_back(tp);
}
cin >> target;
cout << nextGreatestLetter(letters, target);
return 0;
}