Легко Решено: 0 Процент решений: 0%

Word Scramble

Scramble words by swapping each vowel with the consonant right after it, scanning left to right.

Чему вы научитесь

  • Walk through a string with a manual index
  • Swap two adjacent characters
  • Skip ahead after a swap

Условие

Показать перевод

A word puzzle app makes easy scrambles with one rule. Scan each word from left to right. Whenever a vowel (a, e, i, o, u) is directly followed by a consonant (any other letter), swap the two letters and continue scanning after the pair, so a letter is never moved twice. Otherwise move on by one letter.

For example orange: o and r swap to give ro, then scanning continues at a, which swaps with n, then at g, which is not a vowel, and e is the last letter: ronage.

Implement word_scramble(words).

Input

words: The words, in lowercase letters.

Output

Return the scrambled words in the same order. A word with no vowel followed by a consonant comes back unchanged.

Ограничения

0 ≤ number of words ≤ 1,000

1 ≤ word length ≤ 30

Примеры

Пример 1
Ввод:
words = ["orange", "apple"]

Ожидаемый вывод:
expected = ["ronage", "paple"]
Ввод:
std::vector<std::string> words = {"orange", "apple"};

Ожидаемый вывод:
std::vector<std::string> expected = {"ronage", "paple"};
Ввод:
string[] words = new string[] {"orange", "apple"};

Ожидаемый вывод:
string[] expected = new string[] {"ronage", "paple"};

Пояснение

orange becomes ronage as shown above. In apple, a swaps with p to give pa, then p, l and e stay: paple.

Пример 2
Ввод:
words = ["sky", "tea", "eat"]

Ожидаемый вывод:
expected = ["sky", "tea", "eta"]
Ввод:
std::vector<std::string> words = {"sky", "tea", "eat"};

Ожидаемый вывод:
std::vector<std::string> expected = {"sky", "tea", "eta"};
Ввод:
string[] words = new string[] {"sky", "tea", "eat"};

Ожидаемый вывод:
string[] expected = new string[] {"sky", "tea", "eta"};

Пояснение

sky has no vowels and tea has no vowel before a consonant, so both stay. In eat, e is followed by the vowel a, then a swaps with t: eta.

Как подступиться

Сначала попробуйте сами, затем открывайте подсказки по одной.

Подсказка 1

Work on a mutable copy of the word, like a character array.

Подсказка 2

After a swap, move the index forward by 2 so the moved letters are not looked at again.

Подсказка 3

Without a swap, move forward by 1.

Ожидаемая сложность

O(total letters) time, O(longest word) extra space

Ссылки

Это задание адаптировано для CodeUtility. Следуйте условию и ограничениям выше.

Лучшее принятое решение каждого участника. Более быстрые, экономные и высоко оценённые решения стоят выше.

Принятых решений пока нет. Решите задачу и займите первое место.

Учитесь у других

Решения сообщества

Пока нет опубликованных решений. Решите задание, чтобы поделиться первым.