递归分治动态规划实例分析.ppt

3、参考程序 for( i = 1;i = nLength1;i ++ ) { for( j = 1; j = nLength2; j ++ ) { if( sz1[i] == sz2[j] ) aMaxLen[i][j] = aMaxLen[i-1][j-1] + 1; else { int nLen1 = aMaxLen[i][j-1]; int nLen2 = aMaxLen[i-1][j]; if( nLen1 nLen2 ) aMaxLen[i][j] = nLen1; else aMaxLen[i][j] = nLen2; } } } printf(%d\n, aMaxLen[nLength1][nLength2