• maximum-subarray


    /**
    *
    * @author gentleKay
    * 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]has the largest sum =6.
    * click to show more practice.
    * More practice:
    * If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
    *
    *
    * 例如,给定数组[−2,1、−3,4、−1,2,1、−5,4],
    * 相邻子阵列[4、−1、2、1]的最大和=6。
    * 单击此处可显示更多练习。
    * 更多实践:
    * 如果您已经找到了O(N)解决方案,请尝试使用分而治之的方法对另一个解决方案进行编码,这更为微妙。
    */

    /**
     * 
     * @author gentleKay
     * 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]has the largest sum =6.
     * click to show more practice.
     * More practice:
     * If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
     * 
     * 
     * 例如,给定数组[−2,1、−3,4、−1,2,1、−5,4],
     * 相邻子阵列[4、−1、2、1]的最大和=6。
     * 单击此处可显示更多练习。
     * 更多实践:
     * 如果您已经找到了O(N)解决方案,请尝试使用分而治之的方法对另一个解决方案进行编码,这更为微妙。
     */
    
    public class Main17 {
    
    	public static void main(String[] args) {
    		// TODO Auto-generated method stub
    		int[] A = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
    		System.out.println(Main17.maxSubArray(A));
    	}
    	
    	public static int maxSubArray(int[] A) {
    		int max = Integer.MIN_VALUE;
    		for (int i=0;i<A.length;i++) {
    			int sum = 0;
    			for (int j=i;j<A.length;j++) {
    				sum += A[j];
                    if(sum > max){
                        max = sum;
                    }
    			}
    		}
            return max;
        }
    
    }
    

    解题思路:

      主要是进行循环遍历,相加的值与MAX相比较,选出最大的MAX即可。

  • 相关阅读:
    Win10解决RuntimeBroker.exe后台运行CPU占比高的方法
    easyexcel测试用例
    电脑Wlan不能上网的解决办法
    [LeetCode] Delete and Earn 删除与赚取
    [LeetCode] Daily Temperatures 日常温度
    [LeetCode] 738. Monotone Increasing Digits 单调递增数字
    [LeetCode] 737. Sentence Similarity II 句子相似度之二
    [LeetCode] Parse Lisp Expression 解析Lisp表达式
    [LeetCode] Asteroid Collision 行星碰撞
    [LeetCode] 644. Maximum Average Subarray II 子数组的最大平均值之二
  • 原文地址:https://www.cnblogs.com/strive-19970713/p/11262453.html
Copyright © 2020-2023  润新知