Find centralized, trusted content and collaborate around the technologies you use most.
Teams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
给定一个无序集合,如:1,2,3,4,0,5,6,7,-1,-2,-3;
找到其中最长的上升子集。
上述示例集的预期结果是:1,2,3,4,5,6,7
如何实施?
这个问题被称为,你可以在这里Longest increasing subsequence阅读它。
Longest increasing subsequence