0%

[Leetcode]824. Goat Latin (C++)

题目描述

题目链接: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.

例子

例子 1

Input: “I speak Goat Latin”
Output: “Imaa peaksmaaa oatGmaaaa atinLmaaaaa”

例子 2

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

Note

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

解题思路

这道题目比较简单,直接按照通过空格分隔找出所有单词并按下标/首字母进行相应的操作即可,代码如下:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <string>
#include <cctype>

class Solution {
public:
std::string toGoatLatin(std::string S) {

int count = 0, index = 0;
std::string resultS;
while (index < S.length()) {
std::string word;
while (index < S.length() && S[index] != ' ') {
word += S[index];
index++;
}

if (word.empty()) continue;

if (isVowel(word[0]) || word.length() == 1) {
resultS += word;


}
else {
resultS += word.substr(1);
resultS += word[0];
}

count++;
resultS += "ma";
for (int i = 1; i <= count; i++) {
resultS += "a";
}
resultS += " ";
index++;
}

return resultS.substr(0, resultS.length() - 1);

}

private:
bool isVowel(char letter) {
char lower_letter = std::tolower(letter);
return (lower_letter == 'a' ||
lower_letter == 'e' ||
lower_letter == 'i' ||
lower_letter == 'o' ||
lower_letter == 'u');
}
};
  • 时间复杂度:O(n)
  • 空间复杂度:O(n)