please give pseudocode or java code

CS algorithms Use the following ideas to develop a nonrecursive, linear-time algorithm for the maximum-subarray problem. Start at the left end of the array, and progress toward the right, keeping track of the maximum subarray seen so far. Knowing a maximunm subarray of A[l . . j], extend the answer to find a maximum subarray ending at in- dex j +1 by using the following observation: a maximum subarray of A[1 +1 is either a maximum subarray of A[i.. j] or a subarray Alij1], for some l ij + 1. Determine a maximum subarray of the form Ali..j + 1 in constant time based on knowing a maximum subarray ending at index j