#leetcode#Maximum Subarray

来源:互联网 发布:怎样修炼丹田知乎 编辑:程序博客网 时间:2024/06/06 17:31

<p>一种动态规划模式:   <strong>局部最优和全局最优</strong> </p><div></div>
</pre><pre name="code" class="java">public class Solution {    public int maxSubArray(int[] nums) {        // int local  = Integer.MIN_VALUE;        // int global = Integer.MIN_VALUE;        int local = nums[0];        int global = nums[0];        for(int i = 1; i < nums.length; i++){            local = Math.max(nums[i], local + nums[i]);            global = Math.max(global, local);        }        return global;    }}




类似的还有 Best Time to Buy and Sell Stocks.



0 0