[leetcode] 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.

代码:

class Solution {
public:
    string newString(vector<string>& words){
        string v = "aeiouAEIOU";
        for(int i = 0; i < words.size(); i++){
            if(v.find(words[i][0]) != string::npos){
                words[i] += "ma";
            }else{
                char c = words[i][0];
                words[i].erase(words[i].begin());
                words[i] += c;
                words[i].append("ma");
            }
            words[i].append(i+1, 'a');
        }
        string res;
        for(int i = 0; i < words.size(); i++){
            if(i == 0) res = words[i];
            else res += ' ' + words[i];            
        }
        return res;
    }
    string toGoatLatin(string S) {
        vector<string> words;
        int index = 0;
        while((index = S.find(" ")) != string::npos){
            string subs = S.substr(0, index);
            S = S.substr(index+1);
            words.push_back(subs);
        }
        words.push_back(S);
        string res = newString(words);
        return res;
    }
};
   string toGoatLatin(string S) {
        unordered_set<char> vowel({'a', 'e', 'i', 'o', 'u', 'A', 'E', 'I', 'O', 'U'});
        istringstream iss(S);
        string res, w;
        int i = 0, j;
        while (iss >> w) {
            res += ' ' + (vowel.count(w[0]) == 1 ? w : w.substr(1) + w[0]) + "ma";
            for (j = 0, ++i; j < i; ++j) res += "a";
        }
        retur


阅读更多
个人分类: leetcode
想对作者说点什么? 我来说一句

matlab goat 工具箱的例子

2011年03月09日 30KB 下载

遗传算法工具箱GOAT

2013年06月21日 102KB 下载

没有更多推荐了,返回首页

不良信息举报

[leetcode] 824. Goat Latin

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭