Facile 0 résolus 0 % de réussite

Word Scramble

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

Ce que vous allez apprendre

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

Problème

Afficher la traduction

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.

Contraintes

0 ≤ number of words ≤ 1,000

1 ≤ word length ≤ 30

Exemples

Exemple 1
Entrée :
words = ["orange", "apple"]

Sortie attendue :
expected = ["ronage", "paple"]
Entrée :
std::vector<std::string> words = {"orange", "apple"};

Sortie attendue :
std::vector<std::string> expected = {"ronage", "paple"};
Entrée :
string[] words = new string[] {"orange", "apple"};

Sortie attendue :
string[] expected = new string[] {"ronage", "paple"};

Explication

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

Exemple 2
Entrée :
words = ["sky", "tea", "eat"]

Sortie attendue :
expected = ["sky", "tea", "eta"]
Entrée :
std::vector<std::string> words = {"sky", "tea", "eat"};

Sortie attendue :
std::vector<std::string> expected = {"sky", "tea", "eta"};
Entrée :
string[] words = new string[] {"sky", "tea", "eat"};

Sortie attendue :
string[] expected = new string[] {"sky", "tea", "eta"};

Explication

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.

Comment l'aborder

Essayez d'abord seul, puis ouvrez les indices un par un.

Indice 1

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

Indice 2

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

Indice 3

Without a swap, move forward by 1.

Complexité attendue

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

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

La meilleure solution validée de chaque codeur. Les plus rapides, les plus légères et les mieux notées passent devant.

Aucune solution validée pour l'instant. Résolvez-le et prenez la première place.

Apprenez des autres

Solutions de la communauté

Aucune solution publiée pour l'instant. Résolvez ce défi pour partager la première.