2019年9月4日
第一周 01-复杂度2 Maximum Subsequence Sum
摘要： Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i+1​​, ..., N​j​​ } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequen... 阅读全文
posted @ 2019-09-04 00:35 yyer 阅读(274) 评论(0) 推荐(0) 编辑