|
|
back to boardHow to solve this problem? Posted by stm512 15 Apr 2007 09:26 How to use DP? I don't know how to solve this problem!!! Re: How to solve this problem? opt[i] = Min{opt[i-len[j]]} + 1 (1<=j<=N and the No.j word in the dict matches the last len[j] numbers of the telephoon number) |
|
|