leetcode 546. Remove Boxes 删除箱子获得最大的分数 + 很复杂的DP + z做不出来
Givenseveralboxeswithdifferentcolorsrepresentedbydifferentpositivenumbers.Youmayexperienceseveralroundstoremoveboxesuntilthereisnoboxleft.Eachtimeyoucanchoosesomecontinuousboxeswiththesamecolor(compos