题目描述：
A sentence S is given, composed of words separated by spaces. Each word consists of lowercase and uppercase letters only.
We would like to convert the sentence to "Goat Latin" (a made-up language similar to Pig Latin.)
The rules of Goat Latin are as follows:
- If a word begins with a vowel (a, e, i, o, or u), append
"ma"to the end of the word.
For example, the word 'apple' becomes 'applema'.
- If a word begins with a consonant (i.e. not a vowel), remove the first letter and append it to the end, then add
"ma".
For example, the word"goat"becomes"oatgma".
- Add one letter
'a'to the end of each word per its word index in the sentence, starting with 1.
For example, the first word gets"a"added to the end, the second word gets"aa"added to the end and so on.
Return the final sentence representing the conversion from S to Goat Latin.
Example 1:
Input: "I speak Goat Latin" Output: "Imaa peaksmaaa oatGmaaaa atinLmaaaaa"
Example 2:
Input: "The quick brown fox jumped over the lazy dog" Output: "heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa"
Notes:
Scontains only uppercase, lowercase and spaces. Exactly one space between each word.1 <= S.length <= 150.
要完成的函数：
string toGoatLatin(string S)
说明：
1、这道题给定一个字符串S，里面包含单词，大小写敏感，单词之间以空格隔开，要求把英文转化为“goat latin”，规则如下：
如果单词以元音字母a/e/i/o/u以及它们的大写形式开头，那么在单词的最后面加“ma”。
如果单词不以元音字母开头，那么把单词的首字母放到最后面，再在单词的最后面加“ma”。
第一个单词在最后再加“a”，第二个单词在最后再加“aa”，第三个单词在最后再加“aaa”，依此类推。
2、题意清晰，这道题目很容易。
直接分享给大家代码（附详解），如下：
string toGoatLatin(string S)
{
int i=0,s1=S.size(),j=1,count=0;//i表示单词首字母位置，j表示空格位置
setset1{'a','e','i','o','u','A','E','I','O','U'};
string word;//代表取出的每个单词
string res="";
while(i 上述代码逻辑清晰，实测6ms，因为服务器接受到的cpp submissions有限，所以没有打败的百分比。