[Swift]LeetCode1163. 按字典序排在最后的子串 | Last Substring
发布时间:2020-12-14 04:25:54 所属栏目:百科 来源:网络整理
导读:★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ?微信公众号:为敢(WeiGanTechnologies) ?博客园地址:山青咏芝(https://www.cnblogs.com/strengthen/) ?GitHub地址:https://github.com/strengthen/LeetCode ?原文
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ Example 1: Input: "abab"
Output: "bab" Explanation: The substrings are ["a","ab","aba","abab","b","ba","bab"]. The lexicographically maximum substring is "bab".
Example 2: Input: "leetcode"
Output: "tcode"
Note:
给你一个字符串? 示例 1: 输入:"abab" 输出:"bab" 解释:我们可以找出 7 个子串 ["a","bab"]。按字典序排在最后的子串是 "bab"。 示例?2: 输入:"leetcode" 输出:"tcode" 提示:
(编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |