Средне Решено: 0 Процент решений: 0%

Hidden Word Clue

Build the clue for a word guessing game: exact letters, letters in the wrong spot, and misses.

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

  • Compare two strings position by position
  • Use counts to handle repeated letters
  • Build a result string from characters

Условие

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

In a classroom word game one player hides a word and the other guesses words of the same length. After each guess the game shows a clue with one character per position:

  • the letter itself if the guess has the right letter in that position;
  • + if the letter is in the hidden word but somewhere else;
  • * if it is not.

Repeated letters are handled by counting: first mark every exact match. The hidden word's letters that were not matched exactly are then available for + marks. Going through the guess from left to right, each non-exact letter takes one available copy of that letter and gets a +; when no copy is left it gets a *.

Implement hidden_word_clue(hidden, guess).

Input

hidden: The hidden word in uppercase letters.

guess: The guess in uppercase letters, the same length as hidden.

Output

Return the clue as a string with the same length as the words.

Ограничения

1 ≤ word length ≤ 20

Both words use only A-Z

Примеры

Пример 1
Ввод:
hidden = "PLANT"
guess = "PANEL"

Ожидаемый вывод:
expected = "P++*+"
Ввод:
std::string hidden = "PLANT";
std::string guess = "PANEL";

Ожидаемый вывод:
std::string expected = "P++*+";
Ввод:
string hidden = "PLANT";
string guess = "PANEL";

Ожидаемый вывод:
string expected = "P++*+";

Пояснение

P is exact. A, N and L are in PLANT but in other places, and there is no E: P++*+.

Пример 2
Ввод:
hidden = "APPLE"
guess = "PAPPY"

Ожидаемый вывод:
expected = "++P**"
Ввод:
std::string hidden = "APPLE";
std::string guess = "PAPPY";

Ожидаемый вывод:
std::string expected = "++P**";
Ввод:
string hidden = "APPLE";
string guess = "PAPPY";

Ожидаемый вывод:
string expected = "++P**";

Пояснение

The middle P (position 3) is exact. One more P is left in APPLE, so the first P gets + and the second extra P gets *. A is elsewhere, Y is missing: ++P**.

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

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

Подсказка 1

Do two passes: exact matches first, then the rest.

Подсказка 2

Count the hidden word's letters that were not exact matches.

Подсказка 3

A `+` uses up one copy of its letter from those counts.

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

O(n) time, O(1) extra space

Ссылки

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

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

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

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

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

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