华为oj 查找两个字符串a,b中的最长公共子串

#include
#include
using namespace std;

void getMaxSub(string a,string b)
{
	int len1 = a.length();
	int len2 = b.length();
	int maxlen = 0;
	int mstart = 0,mend = 0;
	for(int i = 0; imaxlen)
				{
					 maxlen = temp;
					 mstart = temps;
					 mend = mstart + maxlen-1; 
				}
            }			
		}
	}
	
	if(maxlen>0)
	{
	    for(int k = mstart;k<=mend;k++)
	    {
		   cout<>a>>b;
	getMaxSub(a,b); 
	return 0;
}