Why is the time complexity of this problem only consider the previous recursive call and not the entire problem?
问题 Here we have a box that is 4 * 7 and it can be filled with rectangles that are either 1 * 2 or 2 * 1. This depiction is from the book Competitive Programmer's Handbook . To solve this problem most efficiently, the book mentions using the parts that can be in a particular row: Since there are 4 things in this set, the maximum unique rows we can have is 4^m, where m is the number of columns. From each constructed row, we construct the next row such that it is valid. Valid means we cannot have