动态规划之最长公共子序列

package main  2
import (  4     "fmt"
)  6
func LCS(a, b string) []rune {  8     var L [][]int
    row := len(a) + 1
    col := len(b) + 1
    L = make([][]int, row) 12     var i, j int
    for i = 0; i < row; i++ { 14         L[i] = make([]int, col) 15  } 16     //初始化第一行为0
    for i = 0; i < row; i++ { 18         L[i][0] = 0
 } 20     //初始化第一列为0
    for j = 0; j < col; j++ { 22         L[0][j] = 0
 } 24     var m, n int
    res := make([]rune, 0) 26     for i = 0; i < row-1; i++ { 27         m = i + 1
        for j = 0; j < col-1; j++ { 29             n = j + 1
            if a[i] == b[j] { 31                 L[m][n] = L[m-1][n-1] + 1
                res = append(res, rune(a[i])) 33             } else if L[m-1][n] > L[m][n-1] { 34                 L[m][n] = L[m-1][n] 35             } else { 36                 L[m][n] = L[m][n-1] 37  } 38  } 39  } 40     return res 41 } 42
func main() { 44     res := LCS("xyxxzxyzxy", "zxzyyzxxyxxz") 45  fmt.Println(res) 46 }