824. Goat Latin

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:

1
2
Input: "I speak Goat Latin"
Output: "Imaa peaksmaaa oatGmaaaa atinLmaaaaa"

Example 2:

1
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.

题目大意

以空格将字符串分成一个数组,根据如下规则生成新的字符串。

  • 如果以元音字母开头,则直接在尾部加上 ma
  • 否则,将第一个字母移至尾部,再在尾部加上 ma
  • i 个字符串,则在尾部添加 ia

解题思路

根据题目要求处理字符串。

代码

Solution {
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
func toGoatLatin(_ S: String) -> String {
var ans = ""
let vowel = "aeiouAEIOU"
for (i, s) in S.split(separator: " ").enumerated() {
var v = ""
if vowel.contains(s.first!) {
v += s
}else {
v += s[s.index(s.startIndex, offsetBy: 1)...] + String(s.first!)
}
ans.append(v + "ma" + String(repeating: "a", count: i+1) + " ")
}
ans.removeLast()
return ans
}
}
0%