leetcode744. Find Smallest Letter Greater Than Target(一次遍历)

最新推荐文章于 2021-09-10 22:30:42 发布

Rudy Chan

最新推荐文章于 2021-09-10 22:30:42 发布

阅读量156

点赞数

分类专栏： ez

本文链接：https://blog.csdn.net/rudychan/article/details/100648594

版权

ez 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

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”

做法：一次遍历，记录最小字符和比target大一点的最小字符。

class Solution {
    public char nextGreatestLetter(char[] letters, char target) {  
    char res=' ';
    char min='z';
    int least=30;
    for(int i=0;i<letters.length;i++){
        if((letters[i]-target)>0&&(letters[i]-target)<least)   {
          least= letters[i]-target;
          res=letters[i];
        }
       if((letters[i]-min)<=0  ) min=letters[i];       
    }    
  return res==' '?min:res;        
    }
}