"Face question 31" continuous sub-array of the most Yamato

"Title description"

Enter an array of integers with positive numbers and negative numbers. A sub-array of one or more consecutive integers in the array that is the maximum value of all the sub-arrays.

Requires a time complexity of O (n).

"Solutions"

Solution One: an example of analyzing the law of arrays

My code implementation is for reference only:

1          Public Static intFindgreatestsumofsubarray (int[] arr)2         {3             if(arr = =NULL|| Arr. Length <1)4                 return-1;5 6             intmax = arr[0];7             intPrev = arr[0];8 9              for(inti =1; I < arr. Length; i++)Ten             { One                 if(Arr[i] + prev >Arr[i]) A                 { -Prev + =Arr[i]; -                 } the                 Else -                 { -Prev =Arr[i]; -                 } +  -max = prev > Max?Prev:max; +             } A  at             returnMax; -}

"Face question 31" continuous sub-array of the most Yamato