LeetCode之Find Smallest Letter Greater Than Target(Kotlin)
2017-12-20 23:32
471 查看
问题:
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’.
方法:
两种情况:第一种target大于所有元素,则result应该返回所有元素的最小值;第二种情况target在’a’和’z’之间,则返回大于target的最小值。
具体实现:
有问题随时沟通
具体代码实现可以参考Github
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’.
方法:
两种情况:第一种target大于所有元素,则result应该返回所有元素的最小值;第二种情况target在’a’和’z’之间,则返回大于target的最小值。
具体实现:
class NextGreatestLetter { fun nextGreatestLetter(letters: CharArray, target: Char): Char { var result = 'z' var min = letters[0] var wrapAround = true for(ch in letters) { if (ch > target && ch <= result) { result = ch wrapAround = false } if (ch < min) { min = ch } } if (wrapAround) { return min } return result } } fun main(args: Array<String>) { val array = charArrayOf('c', 'f', 'j') val target = 'c' val nextGreatestLetter = NextGreatestLetter() val result = nextGreatestLetter.nextGreatestLetter(array, target) println("result: $result") }
有问题随时沟通
具体代码实现可以参考Github
相关文章推荐
- [LeetCode] Find Smallest Letter Greater Than Target 找比目标值大的最小字母
- Find Smallest Letter Greater Than Target(leetcode)
- leetcode745: Find Smallest Letter Greater Than Target
- LeetCode 744 Find Smallest Letter Greater Than Target
- Find Smallest Letter Greater Than Target
- BinarySearch-744-Find Smallest Letter Greater Than Target
- LeeCode Contest 62 Find Smallest Letter Greater Than Target
- leetcode744: Find Smallest Letter Greater Than Target
- Find Smallest Letter Greater Than Target
- Find Smallest Letter Greater Than Target
- Find Smallest Letter Greater Than Target问题及解法
- [Leetcode] 373. Find K Pairs with Smallest Sums 解题报告
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- leetcode之Find K Pairs with Smallest Sums
- leetcode:heap:Find K Pairs with Smallest Sums(373)
- ORA-00823: Specified value of sga_target greater than sga_max_size
- leetcode 373. Find K Pairs with Smallest Sums 暴力循环求解
- ORA-00837: Specified value of MEMORY_TARGET greater than MEMORY_MAX_TARGET
- Smallest subarray with sum greater than a given value
- LeetCode-Find K Pairs with Smallest Sums