@Test public void maxSequenceSum() { int[] array = {-2, 1, -3, 4, -1, 2, 1, -5, 4}; System.out.println("maxSequenceSum, res is: " + DataUtil.maxSequenceSum(array)); }
public static int maxSequenceSum(int[] array) { int[] dpArray = new int[array.length]; dpArray[0] = array[0]; int max = array[0]; for (int i = 1; i < array.length; i++) { dpArray[i] = Math.max(array[i], array[i] + dpArray[i - 1]); max = dpArray[i] > max ? dpArray[i] : max; } return max; }
DataUtil { public static int maxSequenceSum(int[] array) { int[] dpArray = new int[array.length]; dpArray[0] = array[0]; int max = array[0]; for (int i = 1; i < array.length; i++) { dpArray[i] = Math.max(array[i], array[i] + dpArray[i - 1]); max = dpArray[i] > max ? dpArray[i] : max; } return max; } }
DataUtil { public static int maxSequenceSum(int[] array) { int[] dpArray = new int[array.length]; dpArray[0] = array[0]; int max = array[0]; for (int i = 1; i < array.length; i++) { dpArray[i] = Math.max(array[i], array[i] + dpArray[i - 1]); max = dpArray[i] > max ? dpArray[i] : max; } return max; }  }
DataUtil { public static int maxSequenceSum(int[] array) { int[] dpArray = new int[array.length]; dpArray[0] = array[0]; int max = array[0]; for (int i = 1; i < array.length; i++) { dpArray[i] = Math.max(array[i], array[i] + dpArray[i - 1]); max = dpArray[i] > max ? dpArray[i] : max; } return max; }  static int getMatrixHeavy(int[][] matrix, int m, int n); static int maxSequenceSum(int[] array); static int fibonacciRecursive(int n); static int fibonacci(int n); static int findMaxUnContinuousSum(int[] array); static void findContinuousSequenceMethod1(int n); static void findContinuousSequenceMethod2(int n); static void findContinuousSequenceMethod3(int n); static void findContinuousSequenceMethod4(int n); static void pickNum(int[] originArray, int n, int m, int[] selectArray, int startIndex, boolean inorder); static int binarySearch(int[] array, int key); static int findFirstEqual(int[] array, int key); static int findFirstEqualLarger(int[] array, int key); static int findFirstLarger(int[] array, int key); static int findLastEqual(int[] array, int key); static int findLastEqualSmaller(int[] array, int key); static List<Integer> shufflePump(List<Integer> origin); static List<Integer> shuffleSwap(List<Integer> origin); static int[] shuffleSwap(int[] origin); static String getAccurateDivide(int a, int b, int n); static Set<Integer> getPrimeNumInefficient(int range); static Set<Integer> getPrimeNumEfficient(int range); static int getIntervalDays(int year, int month, int day); static int pageHelper(int n, int m); static boolean isOdd(int num); }
DataUtil { public static int maxSequenceSum(int[] array) { int[] dpArray = new int[array.length]; dpArray[0] = array[0]; int max = array[0]; for (int i = 1; i < array.length; i++) { dpArray[i] = Math.max(array[i], array[i] + dpArray[i - 1]); max = dpArray[i] > max ? dpArray[i] : max; } return max; }  static int getMatrixHeavy(int[][] matrix, int m, int n); static int maxSequenceSum(int[] array); static int fibonacciRecursive(int n); static int fibonacci(int n); static int findMaxUnContinuousSum(int[] array); static void findContinuousSequenceMethod1(int n); static void findContinuousSequenceMethod2(int n); static void findContinuousSequenceMethod3(int n); static void findContinuousSequenceMethod4(int n); static void pickNum(int[] originArray, int n, int m, int[] selectArray, int startIndex, boolean inorder); static int binarySearch(int[] array, int key); static int findFirstEqual(int[] array, int key); static int findFirstEqualLarger(int[] array, int key); static int findFirstLarger(int[] array, int key); static int findLastEqual(int[] array, int key); static int findLastEqualSmaller(int[] array, int key); static List<Integer> shufflePump(List<Integer> origin); static List<Integer> shuffleSwap(List<Integer> origin); static int[] shuffleSwap(int[] origin); static String getAccurateDivide(int a, int b, int n); static Set<Integer> getPrimeNumInefficient(int range); static Set<Integer> getPrimeNumEfficient(int range); static int getIntervalDays(int year, int month, int day); static int pageHelper(int n, int m); static boolean isOdd(int num);  }