Tutte le sfide
Facile 0 risolte 0% di accettazione

Word Scramble

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

Cosa imparerai

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

Problema

Mostra traduzione

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.

Vincoli

0 ≤ number of words ≤ 1,000

1 ≤ word length ≤ 30

Esempi

Esempio 1
Input:
words = ["orange", "apple"]

Output atteso:
expected = ["ronage", "paple"]
Input:
std::vector<std::string> words = {"orange", "apple"};

Output atteso:
std::vector<std::string> expected = {"ronage", "paple"};
Input:
string[] words = new string[] {"orange", "apple"};

Output atteso:
string[] expected = new string[] {"ronage", "paple"};

Spiegazione

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

Esempio 2
Input:
words = ["sky", "tea", "eat"]

Output atteso:
expected = ["sky", "tea", "eta"]
Input:
std::vector<std::string> words = {"sky", "tea", "eat"};

Output atteso:
std::vector<std::string> expected = {"sky", "tea", "eta"};
Input:
string[] words = new string[] {"sky", "tea", "eat"};

Output atteso:
string[] expected = new string[] {"sky", "tea", "eta"};

Spiegazione

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.

Come affrontarlo

Prova prima da solo, poi apri un suggerimento alla volta.

Suggerimento 1

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

Suggerimento 2

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

Suggerimento 3

Without a swap, move forward by 1.

Complessità attesa

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

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

La migliore soluzione superata di ogni programmatore. Le più veloci, leggere e meglio valutate stanno in alto.

Ancora nessuna soluzione superata. Risolvila e prendi il primo posto.

Impara dagli altri

Soluzioni della community

Nessuna soluzione pubblicata. Risolvi questa sfida per condividere la prima.