题目描述:
代码如下:
class Solution {
public:
char nextGreatestLetter(vector<char>& letters, char target) {
char res='z';
int flag=0;
for(int i=0;i<letters.size();i++){
if(letters[i]>target){
flag=1;
res=min(res,letters[i]);
}
}
if(flag==0)
return letters[0];
else return res;
}
};