/** * The java code of maxmum length the none descending series * using dynamic programming. * @author Fash * @version 1.0 * @since 2015.3.9 */public class LIS { public LIS() { } public static void main(String[] args) { int[] A={ 5,3,4,8,6,7 }; System.out.println(LIS.list(A)); } public static int list(int[] A){ int[] d=new int[A.length]; int len=1; int last=len; for(int i=0;i<="a[i]&&d[j]+1">d[i]){ d[i]=d[j]+1; } } if(d[i]>len){ len=d[i]; last=i; } if(i==1)last=2; System.out.printf("%4d d(%d) = %2d( 序列:%2d ) 下标:%2d", i+1,i,d[i],A[i],last); System.out.println(); } return len; }}="a[i]&&d[j]+1">
联系客服