【LeetCode】744. Find Smallest Letter Greater Than Target（C++）

最新推荐文章于 2020-10-08 20:27:53 发布

Ethan95

最新推荐文章于 2020-10-08 20:27:53 发布

阅读量158

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Ethan95/article/details/83934016

版权

LeetCode 专栏收录该内容

82 篇文章 0 订阅

订阅专栏

地址：https://leetcode.com/problems/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”

Input: letters = [“c”, “f”, “j”]
target = “d”
Output: “f”

Input: letters = [“c”, “f”, “j”]
target = “g”
Output: “j”

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

Input: letters = [“c”, “f”, “j”]
target = “k”
Output: “c”

Note:

letters has a length in range [2, 10000].
letters consists of lowercase letters, and contains at least 2 unique letters.
target is a lowercase letter.

理解：

在范围内二分查找，不在就返回首元素。

实现：

可以用STL的upper_bound(beg,end,target)。
注意：
upper_bound()返回大于target的元素的迭代器
lower_bound()返回大于等于target的元素的迭代器

class Solution {
public:
    char nextGreatestLetter(vector<char>& letters, char target) {
        auto iter=upper_bound(letters.begin(), letters.end(), target);
        if (iter != letters.end()) {
            return *iter;
        }
        return letters[0];
    }
};

也可以手写二分查找
注意这里是寻找比target大的第一个元素。
如果letters[mid]<=target，就说明要寻找的元素起点至少为mid+1，则l=mid+1，否则，letters[mid]>target，就说明mid至少可以满足条件，把上界设为mid。当l和h都满足大于target的时候，每次把h折半，最终会缩小到l。

class Solution {
public:
	char nextGreatestLetter(vector<char>& letters, char target) {
		if (target < letters[0] || target >= letters.back())
			return letters[0];
		int l = 0, h = letters.size() - 1;
		while (l < h) {
			int mid = l + (h - l) / 2;
			if (letters[mid] <= target)
				l = mid + 1;
			else
				h = mid;
		}
		return letters[l];
	}
};

今天七点多起来，中午也没睡，下午还上了网球课，实在累得受不了了。。。上一道最短路径的算法，什么都写不出来，明天再说吧。