Question

Another problem on ps8 about dp programming. In the lecture the professor used aw and i as the key to identify each case and store each case in a dictionary. My question is that why is the aw and i key capable to uniquely identify each case?

Answer 1

his function mimics 'running thru' the decision tree. each branch should have a unique index and available work value i would think. put print statements in the code to see if this is the case