有关两个字符串匹配的一道题

roynee

墨衍会员 · AI 创作全网分发码龄18年

关注

原创最新推荐文章于 2026-07-03 20:45:40 发布 1.1k 阅读 AI 写同款· GEO 优化 ›

AI权益加码！Claude Code、Cursor等20+工具免费用！购周边限时加赠Coding Plan Lite，畅享主流AI工具！学习进阶更高效！阅读详情

[问题描述]

求两个字符串的公共字符集(字符间的相对顺序保持不变)对应的公共的字符串。

如：12478和14890 的公共字符集是 148

[问题求解]

利用动态规划。构建字符匹配与否的二维数组。

[程序代码]

/* * main.cpp * * Created on: 2009-7-8 * Author: NeeSky */ #define MAXSIZE 100 #include <iostream> using namespace std; //The Global Variables bool Matrix2String[MAXSIZE][MAXSIZE]; /*** * Initilization the string according the two strings * @param strA * @param strB | */ void InitMatrix_from2Strings(string& strA, string& strB ) { assert(strA.length()<MAXSIZE &&strA.length()<MAXSIZE); for (unsigned int i = 0; i < strA.length(); ++i) for (unsigned int j = 0; j < strB.length(); ++j) Matrix2String[i][j] = (strA[i] == strB[j]) ? true : false; return; } /*** * Get the Next Char from istart and jstart ( rowNO >=istart, colNO>=jstart ) * @return */ string getThisCommonChars(string &strA, string &strB, int istart, int jstart ) { string returnString = ""; for (unsigned int i = istart; i < strA.length(); ++i) for (unsigned int j = jstart; j < strB.length(); ++j) if (strA[i] == strB[j]) {returnString += strA[i]; jstart=j+1; break;} return returnString; } /*** * Core Algorithm : Get the Max Common Chars * @return */ void getMaxCommonChars_from2Strings(string& strA, string& strB ) { InitMatrix_from2Strings(strA, strB); /*Initilize the two strings*/ string strMaxComChars = "" , strThisMaxComChars = ""; for (unsigned int i = 0; i < strA.length(); ++i) //Start from 1st Line { for (unsigned int j = 0; j < strB.length(); ++j) { if (Matrix2String[i][j] == true) { string tempStr = getThisCommonChars(strA, strB, i, j); strThisMaxComChars = tempStr.length() > strThisMaxComChars.length() ? tempStr : strThisMaxComChars; } } if (strThisMaxComChars.length() > strMaxComChars.length()) strMaxComChars = strThisMaxComChars; } cout<<"Common SubString Sequncy between /""<< strA<<"/" and /""<<strB ; cout<<"/" is : /""<< strMaxComChars<<"/""<<endl; } /*** * THE MAIN PROGRAMMING * @return */ int main(void ) { string strA = "1221467"; string strB = "221456"; getMaxCommonChars_from2Strings(strA, strB); strA = "214443"; strB = "11443"; getMaxCommonChars_from2Strings(strA, strB); strA = "bbcde"; strB = "bbdefghi"; getMaxCommonChars_from2Strings(strA, strB); strA = "bbcdefi"; strB = "bbdefghi"; getMaxCommonChars_from2Strings(strA, strB); return 0; }

[程序输出]

Common SubString Sequncy between "1221467" and "221456" is : "22146"
Common SubString Sequncy between "214443" and "11443" is : "1443"
Common SubString Sequncy between "bbcde" and "bbdefghi" is : "bbde"
Common SubString Sequncy between "bbcdefi" and "bbdefghi" is : "bbdefi"