摘要: Given boxes of different dimensions, stack them on top of each other to get maximum height such that box on top has strictly less length and width tha 阅读全文
posted @ 2017-08-25 12:17 Review->Improve 阅读(395) 评论(0) 推荐(0) 编辑
摘要: Given an array, find maximum sum increasing subsequence in this array. Solution 1. Recursion For arr[0....n], the max sum increasing subsequence can b 阅读全文
posted @ 2017-08-25 05:55 Review->Improve 阅读(227) 评论(0) 推荐(0) 编辑