代码拉取完成,页面将自动刷新
/**
* Question Link: https://leetcode.com/problems/reverse-vowels-of-a-string/
* Primary idea: Two pointers, iterate the string and swap two characters each time,
*
* Note: the input String is case sensitive; thus "aA" should be transferred to "Aa"
* Time Complexity: O(n), Space Complexity: O(n)
*
*/
class ReverseVowelsOfAString {
func reverseVowels(s: String) -> String {
var left = 0
var right = s.characters.count - 1
var chars = [Character](s.characters)
while left < right {
while left < right && !_isVowel(chars[left]) {
left += 1
}
while left < right && !_isVowel(chars[right]) {
right -= 1
}
guard left < right else {
break
}
_swap(&chars, left, right)
left += 1
right -= 1
}
return String(chars)
}
private func _isVowel(char: Character) -> Bool {
var char = String(char).lowercaseString
if char == "a" || char == "e" || char == "i" || char == "o" || char == "u" {
return true
}
return false
}
private func _swap<T>(inout chars: Array<T>, _ p: Int, _ q: Int) {
var temp = chars[p]
chars[p] = chars[q]
chars[q] = temp
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。