[LeetCode] 345. Reverse Vowels of a String
来源:互联网 发布:黑马java基础班测试题 编辑:程序博客网 时间:2024/06/11 02:04
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) { vector<int> idxs; for (int i = 0; i < s.size(); i++) { if (tolower(s[i]) == 'a' || tolower(s[i]) == 'e' || tolower(s[i]) == 'i' || tolower(s[i]) == 'o' || tolower(s[i]) == 'u') { idxs.push_back(i); } } for (int i = 0, j = (int)idxs.size() - 1; i < j; i++, j--) { swap(s[idxs[i]], s[idxs[j]]); } return s; }};
阅读全文
0 0
- LeetCode 345. Reverse Vowels of a String
- leetcode-345. Reverse Vowels of a String
- #leetcode#345. Reverse Vowels of a String
- [leetcode] 345. Reverse Vowels of a String
- Leetcode:345. Reverse Vowels of a String
- LeetCode *** 345. Reverse Vowels of a String
- LeetCode.345. Reverse Vowels of a String
- LeetCode 345. Reverse Vowels of a String
- Leetcode 345. Reverse Vowels of a String
- LeetCode 345. Reverse Vowels of a String
- 345.[LeetCode]Reverse Vowels of a String
- Leetcode 345. Reverse Vowels of a String
- LeetCode 345. Reverse Vowels of a String
- leetcode 345. Reverse Vowels of a String
- 【leetcode】345. Reverse Vowels of a String
- LeetCode-345.Reverse Vowels of a String
- LeetCode - 345. Reverse Vowels of a String
- [Leetcode]345. Reverse Vowels of a String
- SirDigit CMake 手册详解(二十二)
- 大话数据结构 code 第七章 10关键路径_CriticalPath
- A. Levko and Array Recovery----思维题
- 理解高并发(10).线程通信之_线程中断技术
- Eclipse的基本用法
- [LeetCode] 345. Reverse Vowels of a String
- java中Integer值比较不注意的问题
- LeetCode中应用异或操作的几个题目
- ACM小白入门
- 德国创意ab
- 【Node.js-6】consolidate模板引擎集成、router路由介绍
- MUI框架Ajax获取数据然后在列表显示
- FTPrep, 24 Swap Nodes in Pairs
- 理解高并发(11).线程通信之_join使用及原理