824. Goat Latin

问题描述：

---

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:

• S contains only uppercase, lowercase and spaces. Exactly one space between each word.
• 1 <= S.length <= 150.

解题思路：

我们可以用stringstream配合getline 来获取每一个单词，再对每一个单词进行判断该走那个分支，最后根据单词计数器加入相应个数个a。

代码：

class Solution {
public:
    string toGoatLatin(string S) {
        stringstream ss(S);
        string temp;
        string ret;
        int cnt = 1;
        while(getline(ss, temp, ' ')){
            char lowFirst = tolower(temp[0]);
            if(lowFirst == 'a' || lowFirst == 'e' || lowFirst == 'i' || lowFirst == 'o' || lowFirst == 'u'){
                temp += "ma";
            }else{
                string firstChar = temp.substr(0,1);
                temp.erase(0, 1);
                temp += firstChar;
                temp += "ma";
            }
            for(int i = 0; i < cnt; i++){
                temp.push_back('a');
            }
            ret += temp + " ";
            cnt++;
        }
        ret.pop_back();
        return ret;
    }
};