Please, using Dynamic Programming to solve the problem, Please construct the corresponding two-dimension table for the algorithms and analyze the running time. Don't need to write the code.

(1) Given an integer array 'nums', find a continuous sub array with the maximum sum (the sub array contains at least one element), and return its maximum sum. Sample input: [2,1,3,4,1,2,1,5,4] Sample output: 6