Data Structures and Algorithms
开在初夏-命名忧伤
cs在读研究僧
展开
-
7-4 List Leaves
7-4 List Leaves(25 分)Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.Input Specification:Each input file contains one test case. For each case, ...原创 2018-08-15 16:12:52 · 261 阅读 · 0 评论 -
7-1 Maximum Subsequence Sum
7-1 Maximum Subsequence Sum(25 分)Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maximum Subs...原创 2018-08-15 16:18:27 · 226 阅读 · 0 评论