基于visual Studio2013解决面试题之1102合并字符串

最新推荐文章于 2021-06-04 08:58:08 发布

尹成

最新推荐文章于 2021-06-04 08:58:08 发布

阅读量1.9k

点赞数

分类专栏： VC++编程技术

本文链接：https://blog.csdn.net/itcastcpp/article/details/17454747

版权

VC++编程技术专栏收录该内容

780 篇文章

订阅专栏

题目

解决代码及点评

/*
    给出一个函数来合并两个字符串 A 和 B 。字符串 A 的后几个字节和字符串 B 的前几个字节重叠
	重叠部分只要一份
*/

#include <iostream>
using namespace std;

void CopyStr(char *pszBuf1, char *pszBuf2, char *pszBuf3)
{
    int nLen1 =strlen(pszBuf1);
    int nLen2 =strlen(pszBuf2);
    int nLen3 =nLen1 + nLen2 + 1;
    int nPos1 = 0;
    int nPos2 = 0;
    int nPos3 = 0;

    while (nPos1 < nLen1 - 1 && nPos2 < nLen2 - 1 && nPos3 < nLen3 - 1)
    {
        while (pszBuf1[nPos1] != pszBuf2[0] && nPos1 < nLen1 - 1)
        {
            pszBuf3[nPos3++] = pszBuf1[nPos1++];
        }

        if (nPos1 == nLen1 - 1)
        {//pszBuf1完全结束，不存在重复
            pszBuf3[nPos3++] = pszBuf2[nPos2++];
        }
        else
        {//
            int nTmpPos = nPos1;
            while (pszBuf1[nPos1] == pszBuf2[nPos2] && (nPos1 < nLen1) && (nPos2 < nLen2))
            {
                nPos2++;
                nPos1++;
            }

            if (nPos1 == nLen1)
            {//完全重叠
                nPos2 = 0;
                while (nPos2 < nLen2)
                {
                    pszBuf3[nPos3++] = pszBuf2[nPos2++];
                }
            }
            else
            {//不完全重叠，回复nPos1
                nPos1 = nTmpPos;
                nPos2 = 0;
                pszBuf3[nPos3++] = pszBuf1[nPos1++];
            }
        }
    }
    
    
}
int main()
{
    char szBuf1[] = "aghgh";
    char szBuf2[] = "ghjklqwe";
    int nLen3 = strlen(szBuf1) + strlen(szBuf2) + 1;
    char *pszResult = new char[nLen3];
	int i;
    for (i = 0; i < nLen3; i++)
    {
        pszResult[i] = 0;
    }
    pszResult[i-1] = '\0';
    CopyStr(szBuf1, szBuf2, pszResult);
    cout<<pszResult<<endl;
    system("pause");
    return 0;
}