Given a list of sorted characters letterscontaining 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 =…

public class Solution { public char NextGreatestLetter(char[] letters, char target) { //a-97 z-122 var dic = new List<KeyValuePair<char, char>>(); //key存储当前值,int是下一个值 ; i < letters.Length - ; i++) { dic.Add(])); } dic.Add(], ' ')); ].Key ||…

给定一个只包含小写字母的有序数组letters 和一个目标字母 target,寻找有序数组里面比目标字母大的最小字母. 数组里字母的顺序是循环的.举个例子,如果目标字母target = 'z' 并且有序数组为 letters = ['a', 'b'],则答案返回 'a'. 示例: 输入: letters = ["c", "f", "j"] target = "a" 输出: "c" 输入: letters =…