MaximumSumSubsequence.java edge cases

[nguyendviet]

I think your code here doesn't handle edge cases because it doesn't have the logic:

If T[j] + arr[i] < T[i] => do nothing like in your video here at 4:00.

// line 26
if(arr[j] < arr[i] ){ // should be arr[j] < arr[i] && T[j] + arr[i] >= T[i]
   T[i] = Math.max(T[i], T[j] + arr[i]); // should be T[i] = T[j] + arr[i]
}