http://www.lintcode.com/en/problem/frog-jump/
Suitable for the bottom-up DP approach:
the first jump must be 1 unit.
the other jumps can be multiple units.
That mean a if-else clause is needed inside the loop.
Then the multiple units call for a collection, and we don't want duplication, so a HashSet would be ideal.
There you go:
No comments:
Post a Comment