GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — CodingInterview/Solution42.java at master · legolas007/CodingInterview Expand file tree/ Copy pathSolution42.javaMore file actions 26 lines (23 loc) · 586 Bytes / Copy pathSolution42.javaFile metadata and controls26 lines (23 loc) · 586 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 package com.usher.algorithm.offer; import java.lang.reflect.Array; import java.util.Arrays; /** * @Author: Usher * @Description: */ public class Solution42 { /** * dp[i] = dp[i-1] > 0 ? dp[i-1] + array[i] : array[i] * @param array * @return */ public int FindGreatestSumOfSubArray(int[] array) { int[] dp = new int[array.length]; dp[0] = array[0]; for (int i =1;i < array.length;i++){ dp[i] = dp[i-1] > 0 ? dp[i-1] + array[i] : array[i]; } Arrays.sort(dp); return dp[array.length-1]; } } |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |