[Leetcode] 824. Goat Latin

33 篇文章 0 订阅

题目描述

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"

将因为每个word 按照题目描述的规则转化为Goat Latin文。

C++ 代码实现

使用stringstream 将string split 成多个word ,针对每个word 按照语法的规则进行转换,转换完成之后插入的结果字符串的结尾。

class Solution {
public:
    string toGoatLatin(string S) {    
        string res;
        res.reserve(S.size() << 2);
        string word;
        stringstream ss(S);
        int idx = 1;
        while (getline(ss, word, ' '))
        {
            toGoatLatinWord(word, idx);
            res.append(word);
            res.append(" ");
            idx++;
        }
        res.resize(res.size() - 1);
        return res;
    }
private:
    void toGoatLatinWord(string& word,int idx)
    {
        if (!vowel.count(word.front()))
        {
            word.append(1,word.front());
            word.erase(word.begin());
        }
        word.append("ma");
        word.append(string(idx,'a'));
    }

    unordered_set<char> vowel = {'a','e','i','o','u','A','E','I','O','U'};
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值