qq_20777797的博客

非递归：function reverseList(head) { var prev = null; while (head) { var next = head.next; head.next = prev; prev = head; head = next; } return prev; } 递归：...

Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] ha