| Blog information | Shenyang Aerospace University School of Computer Science 2020 software engineering work |
|---|---|
| Work requirements | https://edu.cnblogs.com/campus/sau/Computer1701-1705/homework/10583| |
| Course objectives | Familiar with the development process a "high-quality" software |
| Jobs goal | Unit Testing Practice |
### a: Title: subarray and maximum continuous (and largest sub-segment) Problem: Given n integer (possibly negative) a sequence consisting of a [1], a [2 ], a [3], ..., a [n], find the sequence as a [i] + a [i + 1] + ... + a [j] and the maximum value of the sub-segments. When given definitions are negative integer and sub-segment 0, so defined, the required optimal values: Max {0, a [i ] + a [i + 1] + ... + a [j]} , 1 <= i <= j <= n For example, when (a [1], a [ 2], a [3], a [4], a [5], a [6]) = (- 2, 11, -4,13, -5, -2), and the maximum of 20 sub-segment. ### II: code implementation View Code ### three: run shot
### Four: determination test flow chart coverage: 
### V: Test results Screenshot 
### six: project work record | Record Results: ---: |: ---: Date | 2020-4-8 start time | 17: 30 end time | 18: | 40 the number of errors | 40 coded lines 0