The following is the leetcode questions and understanding regards to the solutions
this is a test
—————————————
Understanding
—————————————
Approach #1: Bruceforce
Run through the array and try to get every sum possible from the array and then find the max using the Math.max function and output to the method.
Approach #2: skip the negative numbers and only keeps the positive numbers
key: skip the negative numbers that does not attribute to the max result we are looking for