标签:字符 letters target Output 给定 Input 744 Find Greater
问题:
给定一个升序字符数组。
求比给定target字符大的,最小的字符。(假设给定字符数组是循环的,即第一个字符>最后一个字符)
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.
解法:二分查找(Binary Search)
在给定字符数组letters中,找到第一个>target字符的字符。
⚠️ 注意:(字符数组是循环:)若未找到,则返回letters[0]
代码参考:
1 class Solution { 2 public: 3 char nextGreatestLetter(vector<char>& letters, char target) { 4 int l = 0, r = letters.size(); 5 while(l<r) { 6 int m = l+(r-l)/2; 7 if(letters[m]>target) {//找到第一个>target 8 r = m; 9 } else { 10 l = m+1; 11 } 12 } 13 return (l==letters.size())?letters[0]:letters[l]; 14 } 15 };
标签:字符,letters,target,Output,给定,Input,744,Find,Greater 来源: https://www.cnblogs.com/habibah-chang/p/13512244.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。