查找两个字符串a,b中的最长公共子串 http://www.nowcoder.com/questionTerminal/181a1a71c7574266ad07f9739f791506纯C 啊,我终于真正学会了动态规划 #include <stdlib.h> #include <stdio.h> #include <string.h> #define MAX 1500 int main() { int dp[MAX][MAX] = {0}; char str1[MAX] = {'...