Recca Chao 的 gitHub page

推廣網站開發,包含 Laravel 和 Kotlin 後端撰寫、自動化測試、讀書心得等。Taiwan Kotlin User Group 管理員。

View on GitHub

Problem 22


This problem was asked by Microsoft.

Given a dictionary of words and a string made up of those words (no spaces), return the original sentence in a list. If there is more than one possible reconstruction, return any of them. If there is no possible reconstruction, then return null.

For example, given the set of words quick, brown, the, fox, and the string thequickbrownfox, you should return ['the', 'quick', 'brown', 'fox'].

Given the set of words bed, bath, bedbath, and, beyond, and the string bedbathandbeyond, return either ['bed', 'bath', 'and', 'beyond] or ['bedbath', 'and', 'beyond'].