Dailycode_6.10(翻转字符串，最长公共字串长度）

#include <iostream>
#include <string>
using namespace std;

int main()
{
    string str;
    while (cin >> str)
    {
        string ret;
        for (int i = 0; i < str.size(); i++)
        {
        	//头插字符
            ret.insert(ret.begin(), str[i]);
        }
        cout << ret.c_str() << endl;
    }
    return 0;
}

#include <iostream>
#include <string>
#include <vector>
using namespace std;

int  fun(string A, string B)
{
    int maxlength = 0;
    string ret;
    for (size_t i = 0; i < B.size(); ++i)
    {
        for (size_t j = B.size() - i; j > 0; j--)
        {
            ret = B.substr(i,j); //截取
            //判断是否在A字符串中
            if (A.find(ret) != string::npos && maxlength < ret.size())
            {
                maxlength = ret.size();
            }
        }
    }
    return maxlength;
}
int main()
{
    string str1, str2;
    while(cin >> str1 >> str2)
    {
        int len;
        if (str1.size() < str2.size())
            len = fun(str2, str1);
        else
            len = fun(str1,str2);
        cout << len << endl;
    }
    return 0;
}