[Leetcode]345. Reverse Vowels of a String
2016-07-08 22:10
471 查看
Write a function that takes a string as input and reverse only the vowels of a string.
Example 1:
Given s = "hello", return "holle".
Example 2:
Given s = "leetcode", return "leotcede".
class Solution {
public:
string reverseVowels(string s) {
set<char> str{'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O','U'};
int i =0, j = s.size() - 1;
while (i <= j) {
if (str.count(s[i]) != 0 && str.count(s[j]) != 0) {
swap(s[i], s[j]);
++i;
--j;
}
if (str.count(s[j]) == 0)
--j;
if (str.count(s[i]) == 0)
++i;
}
return s;
}
};
Example 1:
Given s = "hello", return "holle".
Example 2:
Given s = "leetcode", return "leotcede".
class Solution {
public:
string reverseVowels(string s) {
set<char> str{'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O','U'};
int i =0, j = s.size() - 1;
while (i <= j) {
if (str.count(s[i]) != 0 && str.count(s[j]) != 0) {
swap(s[i], s[j]);
++i;
--j;
}
if (str.count(s[j]) == 0)
--j;
if (str.count(s[i]) == 0)
++i;
}
return s;
}
};
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解