LeetCode53 动态规划和分治解法
LeetCode53题目穷举法动态规划(Kadane算法)分治解法
题目
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the
原创
2020-07-31 22:07:54 ·
277 阅读 ·
0 评论