345. Reverse Vowels of a String
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".
Note:
The vowels does not include the letter "y".
思路：
找到元音字母，标记位置，进行置换。
代码如下：
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
// vowels(元音字母)包括：a,e,i,o,u.
class
Solution {
public
:
bool
isVowels(
char
c)
{
char
vowels[10] = {
'a'
,
'e'
,
'i'
,
'o'
,
'u'
,
'A'
,
'E'
,
'I'
,
'O'
,
'U'
};
for
(
int
i = 0; i < 10; i++)
{
if
(c == vowels[i])
{
return
true
;
break
;
//return 和 break在一起都有反应么？
}
}
return
false
;
}
string reverseVowels(string s) {
vector<
int
> recordIndex;
vector<
char
> str;
for
(
int
i = 0;i<s.size();i++)
{
str.push_back(s.at(i));
}
for
(
int
i = 0; i < str.size() ; i++)
{
if
( isVowels(str[i]) )
{
recordIndex.push_back(i);
}
}
for
(
int
i = 0 ; i < recordIndex.size() / 2 ; i++)
{
char
left = str[recordIndex[i]];
char
right = str[recordIndex[recordIndex.size() - 1 - i]];
str[recordIndex[i]] = right;
str[recordIndex[recordIndex.size() - 1 - i]] = left;
}
s =
""
;
for
(
int
i = 0 ; i < str.size() ; i++)
{
s.append(1,str[i]);
}
return
s;
}
};
|
本文转自313119992 51CTO博客，原文链接:http://blog.51cto.com/qiaopeng688/1835538
