动态规划求最大连续字序列

package com.yyy.five.day;
  

/**
 * 动态规划求最大连续字序列
 *
 * @author YYY
 *
 */
public class Opp1 {
  

 public static void main(String[] args) {
  int a[] = { -2, 11, -4, 13, -5, 2, -5, -3, 12, -9 };
  System.out.println(getMaxSquence1(a));
  System.out.println(getMaxSquence2(a));
 }
  

 public static int getMaxSquence1(int a[]) {
  int max = a[0];
  int v = 0;
  for (int i = 0; i < a.length; i++) {
   v = 0;
   for (int j = i; j < a.length; j++) {
    v += a[j];
    if (v > max) {
     max = v;
    }
   }
  }
  return max;
 }
  

 public static int getMaxSquence2(int a[]) {
  int max = a[0];
  int v = 0;
  for (int i = 0; i < a.length; i++) {
   v += a[i];
   if (v > max) {
    max = v;
   } else if (v < 0) {
    v = 0;
   }
  }
  return max;
 }
}