The problem can be broken down into "overlapping subproblems"
The problem has an "optimal substructure"
Greedy problems have optimal substructure, but not overlapping subproblems.
Divide and conquer algorithms break a problem into subproblems, but these subproblems are not overlapping.
留言
張貼留言