20160219.CCPP体系详解(0029天)

最新推荐文章于 2024-02-16 17:35:47 发布

置顶

尹成

最新推荐文章于 2024-02-16 17:35:47 发布

阅读量3.8k

点赞数 1

分类专栏： CCPP

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

版权

这篇博客详细解析了六个不同的C语言程序片段，包括ReplaceAll操作、寻找最长数字子串、数组递增判断、数组最大值计算以及两种大数乘法实现，并介绍了C99的新语法特性。

摘要由CSDN通过智能技术生成

程序片段(01):ReplaceAll.c
内容概要:ReplaceAll

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

//01.(删除+替换)所有指定字符串
//  (双索引+双指针)-->(删除+替换)原理
//  注:增加(拓展)+删除(压缩)+修改(压缩|不变|拓展)+查询(不变)
void replaceAll(char ** ppSrcStr, char * pOldStr, char * pNewStr)
{
    char * pSrcStr = *ppSrcStr;//常量指针-->变量指针(同一本体)-->跨函数间接修改常量指针
    int srcStrLen = strlen(pSrcStr);
    int oldStrLen = strlen(pOldStr);
    int newStrLen = strlen(pNewStr);
    char * p1 = pSrcStr;
    char * p2 = pSrcStr;
    if (oldStrLen == newStrLen)
    {
        while (*p1 = *p2)
        {
            int find = 1;
            for (int i = 0; i < oldStrLen; ++i)
            {
                if ('\0' == *(p2 + i) || *(p2 + i) != *(pOldStr + i))
                {
                    find = 0;
                    break;
                }
            }
            if (!find)
            {
                ++p2;
                ++p1;
            }
            else
            {
                for (int i = 0; i < newStrLen; ++i)
                {
                    *(p2 + i) = *(pNewStr + i);
                }
            }
        }
    }
    else if (oldStrLen < newStrLen)
    {
        while (*p1 = *p2)
        {
            int find = 1;
            for (int i = 0; i < oldStrLen; ++i)
            {
                if ('\0' == *(p2 + i) || *(p2 + i) != *(pOldStr + i))
                {
                    find = 0;
                    break;
                }
            }
            if (!find)
            {
                ++p2;
                ++p1;
            }
            else
            {
                int m = p2 - pSrcStr;
                int n = p1 - pSrcStr;
                pSrcStr = *ppSrcStr = (char *)_recalloc(*ppSrcStr, srcStrLen + newStrLen - oldStrLen + 1, sizeof(char));
                p2 = pSrcStr + m;
                p1 = pSrcStr + n;
                int moveLen = newStrLen - oldStrLen;
                for (char * p = p2 + strlen(p2); p >= p2; --p)
                {
                    *(p + moveLen) = *p;
                }
                for (int i = 0; i < newStrLen; ++i)
                {
                    *(p2 + i) = *(pNewStr + i);
                }
            }
        }
    }
    else
    {
        while (*p1 = *p2)
        {
            int find = 1;
            for (int i = 0; i < oldStrLen; ++i)
            {
                if ('\0' == *(p2 + i) || *(p2 + i) != *(pOldStr + i))
                {
                    find = 0;
                    break;
                }
            }
            if (!find)
            { 
                ++p2;
                ++p1;
            }
            else
            {
                for (int i = 0; i < newStrLen; ++i)
                {
  //赋值有效字符串
                    *(p2 + oldStrLen - newStrLen + i) = *(pNewStr + i);
                }
                p2 += oldStrLen - newStrLen;//跳过无效字符串
            }
        }
    }
}

int main01(void)
{
    int srcStrLen = strlen("12345543211234554321");
    char * pStr = (char *)malloc(srcStrLen + 1);
    strcpy(pStr, "12345543211234554321");
    printf("%s \n", pStr);