問題
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.
制約
0 ≤ length of text ≤ 5,000; 1 ≤ words ≤ 1,000
例
例 1
入力：
text = "applepenapple"
words = ["apple", "pen"]
期待される出力：
expected = True入力：
std::string text = "applepenapple";
std::vector<std::string> words = {"apple", "pen"};
期待される出力：
bool expected = true;入力：
string text = "applepenapple";
string[] words = new string[] {"apple", "pen"};
期待される出力：
bool expected = true;解説
"apple" + "pen" + "apple", reusing "apple".
例 2
入力：
text = "catsandog"
words = ["cats", "dog", "sand", "and", "cat"]
期待される出力：
expected = False入力：
std::string text = "catsandog";
std::vector<std::string> words = {"cats", "dog", "sand", "and", "cat"};
期待される出力：
bool expected = false;入力：
string text = "catsandog";
string[] words = new string[] {"cats", "dog", "sand", "and", "cat"};
期待される出力：
bool expected = false;解説
Every split leaves "og" or "ando" unmatched: false.
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。