Problema
Decide whether text can be split into a sequence of words from words. Words may be reused. Dynamic programming over prefixes solves it efficiently.
Implement can_break(text, words).
Input
text: Lowercase letters only. words: The dictionary; each word has 1–50 lowercase letters.
Output
Return true if a split exists.
Vincoli
0 ≤ length of text ≤ 5,000; 1 ≤ words ≤ 1,000
Esempi
Esempio 1
Input:
text = "applepenapple"
words = ["apple", "pen"]
Output atteso:
expected = TrueInput:
std::string text = "applepenapple";
std::vector<std::string> words = {"apple", "pen"};
Output atteso:
bool expected = true;Input:
string text = "applepenapple";
string[] words = new string[] {"apple", "pen"};
Output atteso:
bool expected = true;Spiegazione
"apple" + "pen" + "apple", reusing "apple".
Esempio 2
Input:
text = "catsandog"
words = ["cats", "dog", "sand", "and", "cat"]
Output atteso:
expected = FalseInput:
std::string text = "catsandog";
std::vector<std::string> words = {"cats", "dog", "sand", "and", "cat"};
Output atteso:
bool expected = false;Input:
string text = "catsandog";
string[] words = new string[] {"cats", "dog", "sand", "and", "cat"};
Output atteso:
bool expected = false;Spiegazione
Every split leaves "og" or "ando" unmatched: false.
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.