#include<iostream> #include<string.h> #include<vector> using namespace std; char out[50]; vector<string> re;
int longestSubstring1(string x, string y,int &start) {
int xlen = x.size(); int ylen = y.size(); if (xlen == 0 || ylen == 0) {
return 0; } int max = -1; //暴力破解法,两重for循环加 while for (int i = 0; i < xlen; i++) {
for (int j = 0; j < ylen; j++) {
int m = i, n = j; int len = 0; while (m < xlen && n < ylen) {
if (x[m] != y[n]) {
break; } m++; n++; len++; } if (len > max) {
max = len; start = i; } } } return max; } //动态规划 int longestSubstring2(string x, string y,int &start) {
//设置dp数组 vector<vector<int> > f(x.size() + 1, vector<int>(y.size() + 1, 0)); //vector< vector<int> > f; int max = -1; for (int i = 1; i <