I don't understand why in some dp problems dp[0] is equal to 0,like the coin change problem.Can someone explain this to me?
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
2 | maomao90 | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
I don't understand why in some dp problems dp[0] is equal to 0,like the coin change problem.Can someone explain this to me?
Name |
---|
It depends on what your table actually represents.
Why is not picking anything is also counted as a way?
the empty subset almost always counts as satisfying the condition to most problems.
afaik, in the coin change problem dp[0] = 1, so what do you mean?