編程演算法 - 最長公用子序列(LCS) 代碼(C)

標籤：style   blog   http   color   使用   strong   

最長公用子序列(LCS) 代碼(C)

本文地址: http://blog.csdn.net/caroline_wendy

題目: 給定兩個字串s,t, 求出這兩個字串最長的公用子序列的長度. 字串的子序列並一定要連續, 能夠包含間隔.

即最長公用子序列問題(LCS, Longest Common Subsequence)

使用動態規劃, 假設字元相等, 兩個字串就依次遞增一位, 一直到字串的結尾.

代碼:

/* * main.cpp * *  Created on: 2014.7.17 *      Author: spike *//*eclipse cdt, gcc 4.8.1*/#include <stdio.h>#include <memory.h>#include <limits.h>#include <utility>#include <queue>#include <algorithm>using namespace std;class Program {static const int MAX_N = 100;int n=4, m=4;char s[MAX_N] = "abcd", t[MAX_N] = "becd";int dp[MAX_N+1][MAX_N+1];public:void solve() {for (int i=0; i<n; i++) {for (int j=0; j<m; j++) {if (s[i]==t[j]) {dp[i+1][j+1] = dp[i][j]+1;} else {dp[i+1][j+1] = max(dp[i][j+1], dp[i+1][j]);}}}printf("result = %d\n", dp[n][m]);}};int main(void){Program P;P.solve();    return 0;}

輸出:

result = 3