题目见文末 LeetCode link 思路及题解 手写二分 源码: class Solution: def nextGreatestLetter(self, letters: List[str], target: str) -> str: if letters[0] > target or letters[-1] <= target: return letters[0] start = 1 end = len(letters)-1 while