| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
Word Matcher
You are given a string str and array of string vec. You have to tell whether you can acheive str by combination of strings in vec. You need to use each string of vec atmost once. vec may contain the repeating strings.
constraints: 1<=str.length<=300 1<= vec.length <= 1000 1 <= vec[i].length <=20
Some Please give me the idea to solve.... Thank you in advance
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en3 |
|
abhilash_8642 | 2022-11-03 06:46:25 | 78 | Tiny change: ':\ncodeit // str\n2 // vec.length\ncode \' -> ':\ncodeit \n2 \n\ncode \' | |
| en2 |
|
abhilash_8642 | 2022-11-03 06:42:52 | 5 | Tiny change: '20\n\n\n\nSome Please giv' -> '20\n\n\n\nPlease giv' (published) | |
| en1 |
|
abhilash_8642 | 2022-11-03 06:42:19 | 386 | Initial revision (saved to drafts) |
