To solve a problem by dynamic programming instead of recursions,

To solve a problem by dynamic programming instead of recursions, the key approach is to store the results of computations for the subproblems so that we only have to compute each different subproblem once. Those solutions can be stored in an array or a hash table. ~@[](2)

答案：TRUE