Maximum subarray problem is the method to find the contiguous subarray within a one-dimensional array of numbers which has the largest sum.
確定! 回上一頁