Fácil 0 resueltos 0% de aceptación

Word Scramble

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

Lo que aprenderás

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

Problema

Ver traducción

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.

Restricciones

0 ≤ number of words ≤ 1,000

1 ≤ word length ≤ 30

Ejemplos

Ejemplo 1
Entrada:
words = ["orange", "apple"]

Salida esperada:
expected = ["ronage", "paple"]
Entrada:
std::vector<std::string> words = {"orange", "apple"};

Salida esperada:
std::vector<std::string> expected = {"ronage", "paple"};
Entrada:
string[] words = new string[] {"orange", "apple"};

Salida esperada:
string[] expected = new string[] {"ronage", "paple"};

Explicación

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

Ejemplo 2
Entrada:
words = ["sky", "tea", "eat"]

Salida esperada:
expected = ["sky", "tea", "eta"]
Entrada:
std::vector<std::string> words = {"sky", "tea", "eat"};

Salida esperada:
std::vector<std::string> expected = {"sky", "tea", "eta"};
Entrada:
string[] words = new string[] {"sky", "tea", "eat"};

Salida esperada:
string[] expected = new string[] {"sky", "tea", "eta"};

Explicación

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.

Cómo abordarlo

Inténtalo primero por tu cuenta y luego abre las pistas una a una.

Pista 1

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

Pista 2

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

Pista 3

Without a swap, move forward by 1.

Complejidad esperada

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

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

Clasificación

Clasificación completa

La mejor solución aprobada de cada programador. Las más rápidas, ligeras y mejor valoradas van primero.

Aún no hay soluciones aprobadas. Resuélvelo y quédate el primer puesto.

Aprende de otros

Soluciones de la comunidad

Aún no hay soluciones publicadas. Resuelve este reto para compartir la primera.