Learning progress Bar 5

	Week Six
The time spent	84m
Code Amount	108 rows
Blog Volume	1 Articles
Know the point of knowledge	1. Two methods to find the largest and most of the circulant Subarray are obtained, one is to enlarge the array first and double it. 2. The other is whether the sub-loop boundary is divided, first of all the non-cyclic subarray of the maximum sum and the smallest and, and array sums, Compares the maximum sum of the non-circular subarray and the size of the maximum and minimum values of the non-cyclic subarray with the sums minus. 3. Learn a little Java button, window, and panel design. 4. Manipulate the database in Java.

Learning progress Bar 5