1394 · Goat Latin
Description
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.

S contains only uppercase, lowercase and spaces. Exactly one space between each word.
1 <= S.length <= 150.
Example
Example1
Input: “I speak Goat Latin”
Output: “Imaa peaksmaaa oatGmaaaa atinLmaaaaa”

Example2
Input: “The quick brown fox jumped over the lazy dog”
Output: “heTmaa uickqmaaa rownbmaaaa oxfmaaaaa umpedjmaaaaaa overmaaaaaaa hetmaaaaaaaa azylmaaaaaaaaa ogdmaaaaaaaaaa”

解法1:

class Solution {
public:/*** @param s: * @return: nothing*/string toGoatLatin(string &s) {vector<string> tokens;stringstream ss(s);string buf;vector<char> vowels = {'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'};set<char> vowelSet(vowels.begin(), vowels.end());while (ss >> buf) {tokens.push_back(buf);}string res = "";for (int i = 0; i < tokens.size(); i++) {if (vowelSet.find(tokens[i][0]) != vowelSet.end()) {tokens[i] += "ma";} else {tokens[i] = tokens[i].substr(1) + tokens[i][0] + "ma";}tokens[i] += string(i + 1, 'a');res += tokens[i] + " ";}res.pop_back();return res;}
};