5、字符串操作中相对复杂的几个程序

#include "iostream"
using namespace std;

const int MAX_LEN = 20;
void LoopMove(char* cpStr, int iSteps)
{
	//注意，在整个处理过程中，cpStr的最后字符都没有涉及处理
	char cTempArray[MAX_LEN];
	size_t szStrLength = strlen(cpStr);
	size_t in = szStrLength -iSteps;
	memcpy(cTempArray, cpStr + in, iSteps);
	memcpy(cTempArray + iSteps, cpStr, in);
	memcpy(cpStr, cTempArray, szStrLength);
	cTempArray[szStrLength + 1] = '\0';
	cout << cTempArray << endl;
}

int main() 
{
	char ctemp[] = "abcdefghi";
	LoopMove(ctemp, 2);
	cout << ctemp << endl;
	return 1;
}

#include "iostream"
#include "string"
using namespace std;


int main() 
{
	string strInput;
	cout << "Input a string: " << endl;
	cin >> strInput;
	string strTemp;
	for (size_t i = strInput.length() - 1; i > 1; i--)
	{
		for (size_t j = 0; j < strInput.length(); j++)
		{
			if ((i + j) <= strInput.length())
			{
				size_t szForw = 0;
				size_t szBacw = 0;
				strTemp = strInput.substr(j, i);
				szForw = strInput.find(strTemp);
				szBacw = strInput.rfind(strTemp);
				if (szBacw != szForw)
				{
					cout << strTemp << " " << szForw + 1 << endl;
					return 0;
				}
			}
		}
	}

	return 1;
}

#include "iostream"
#include "string"
using namespace std;

const char* strstr1(const char* strMainString, const char* strSubString)
{
	for (size_t i = 0; strMainString[i]; i++)
	{
		size_t iTempj = 0;
		size_t iTempi = i;
		if (strMainString[iTempi] == strSubString[iTempj])
		{
			while(strMainString[iTempi++] == strSubString[iTempj++])
			{
				if (strSubString[iTempj] == '\0')
					return &strMainString[i];
			}
		}
	}
	return NULL;
}

int main() 
{
    char str1[] = "12345678";
	char str2[] = "234";
	const char *str3 = strstr1(str1, str2);
	cout << str3 << endl;
	return 1;
}

#include "iostream"
#include "string"
//#include "functional"
//#include "algorithm"
using namespace std;

int main() 
{
	cout << "Input a string: " << endl;
	string strOfaLine;
	getline(cin, strOfaLine);	
	size_t szStrLength = strOfaLine.length();
	size_t szTempbeg = 0;
	size_t szTempend = szStrLength - 1;
	
	//第一步，全局交换
	while(szTempbeg < szTempend)
	{
		swap<char>(strOfaLine[szTempbeg++], strOfaLine[szTempend--]);
	}

	//第二步，局部交换
	size_t szTempi = 0;
	while (strOfaLine[szTempi])
	{
		if (strOfaLine[szTempi] != ' ')
		{
			szTempbeg = szTempi;
			while(strOfaLine[szTempi] != '\0' && strOfaLine[szTempi] != ' ')
			{
				szTempi++;
			}
			szTempi--;
			szTempend = szTempi;
		}
		while(szTempbeg < szTempend)
		{
			swap<char>(strOfaLine[szTempbeg++], strOfaLine[szTempend--]);
		}
		szTempi++;
	}
	cout << strOfaLine << endl;
	return 1;
}

#include "iostream"
#include "string"
#include "vector"
//#include "functional"
//#include "algorithm"
using namespace std;

pair<int, string> StaticNum(const string &str)
{
	vector<string> substrs; //存放切割后的子字符串
    string substr;
	int iMaxCount = 1, iCount = 1;
	size_t iTempi, iLen = str.length();
	for (iTempi = 0; iTempi < iLen; iTempi++)
	{
		substrs.push_back(str.substr(iTempi, iLen - iTempi));
	}

	for (iTempi = 0; iTempi < iLen; iTempi++)
	{
		for (size_t iTempj = iTempi + 1; iTempj < iLen; iTempj++)
		{
			iCount = 1;
			if (substrs[iTempi].substr(0, iTempj - iTempi) == substrs[iTempj].substr(0, iTempj - iTempi))
			{
				iCount++;
				//对以后子串每一个都进行比较,iTempj - iTempi 为当前要比较的字符串的长度
				//注意，此时遍历时，步长是iTempj - iTempi
				for (size_t iTempk = iTempj + (iTempj - iTempi); iTempk < iLen; iTempk += iTempj - iTempi)
				{
					if (substrs[iTempi].substr(0, iTempj - iTempi) == substrs[iTempk].substr(0, iTempj - iTempi))
					{
						iCount++;
					}
					else //接下来的字符串已经不连续了
					{
						break;
					}
				}

				if (iCount > iMaxCount)
				{
					iMaxCount = iCount;
					substr = substrs[iTempi].substr(0, iTempj - iTempi);
				}
			}
		}
	}
	return make_pair(iMaxCount, substr);
}

int main() 
{
	string str;
	pair<int, string> rs;
	string strTemp = "abcbcbcabc";
	rs = StaticNum(strTemp);
	cout << rs.first << " " << rs.second << endl;
	return 1;
}