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

最新推荐文章于 2024-09-12 18:01:49 发布

原创最新推荐文章于 2024-09-12 18:01:49 发布 · 861 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#delete #string #each #up

算法专栏收录该内容

51 篇文章

订阅专栏

本文介绍了一个基于动态规划的最长公共子序列(LCS)算法实现。通过记录方向来追踪最长子序列，并展示了如何通过递归回溯找到具体序列。文章提供了一个完整的C++代码示例，演示了如何为两个字符串计算其LCS。

还是动态规划.还是动态规划.写出来了,比较顺手.

// LCSLenth.cpp -- 2011-06-17-23.05 #include "stdafx.h" #include <iostream> #include <cstring> enum {Direction_Left, Direction_Up, Direction_TopLeft} ; char * * LCSLenth (const char * const strA, const char * const strB) ; void printLCS (const char * const * const recordDirection, const char * const strA, const int i, const int j) ; int _tmain(int argc, _TCHAR* argv[]) { char * strA = " ABCBDAB", * strB = " BDCABA" ; char * * recordDirection = LCSLenth (strA, strB) ; printLCS(recordDirection, strA, strlen(strA) - 1, strlen(strB) - 1) ; for (unsigned int i = 0; i < strlen(strA); ++i) delete []recordDirection[i] ; delete []recordDirection ; return 0 ; } // Assume imports two strings, first position of each string dosen't storage character. char * * LCSLenth (const char * const strA, const char * const strB) { int aSize = strlen(strA) ; int * * recordLenth = new int *[aSize] ; char * * recordDirection = new char *[aSize] ; int bSize = strlen(strB) ; for (int i = 0; i < aSize; ++i) { recordLenth[i] = new int[bSize] ; recordDirection[i] = new char[bSize] ; } for (int i = 0; i < aSize; ++i) recordLenth[i][0] = 0 ; for (int i = 0; i < bSize; ++i) recordLenth[0][i] = 0 ; for (int i = 1; i < aSize; ++i) { for (int j = 1; j < bSize; ++j) { if (strA[i] == strB[j]) { recordLenth[i][j] = recordLenth[i - 1][j - 1] + 1 ; recordDirection[i][j] = Direction_TopLeft ; } else if (recordLenth[i - 1][j] >= recordLenth[i][j - 1]) { recordLenth[i][j] = recordLenth[i - 1][j] ; recordDirection[i][j] = Direction_Up ; } else { recordLenth[i][j] = recordLenth[i][j - 1] ; recordDirection[i][j] = Direction_Left ; } } } for (int i = 0; i < aSize; ++i) delete []recordLenth[i] ; delete []recordLenth ; return recordDirection ; } void printLCS (const char * const * const recordDirection, const char * const strA, const int i, const int j) { if (0 == i || 0 == j) return ; if (Direction_TopLeft == recordDirection[i][j]) { printLCS(recordDirection, strA, i - 1, j - 1) ; std ::cout << strA[i] ; } else if (Direction_Left == recordDirection[i][j]) printLCS(recordDirection, strA, i, j - 1) ; else printLCS(recordDirection, strA, i - 1, j) ; }