zoukankan      html  css  js  c++  java
  • c语言 9-10

    1、

    #include <stdio.h>
    
    void del(char x[])
    {
        int len = 0;
        while(x[len])
            len++;
        char tmp[len];
        int i = 0, j = 0;
        while(x[i])
        {
            if(x[i] < '0' || x[i] > '9')
            {
                tmp[j] = x[i];
                j++;
            }
            i++;
        }
        i = 0;
        while(x[i])
        {
            x[i] = '';
            i++;
        }
        while(j-- > 0)
            x[j] = tmp[j];
    }
    
    int main(void)
    {
        char str[128];
        printf("str: "); scanf("%s", str);
        
        del(str);
        int i = 0;
        while(str[i])
            putchar(str[i++]);
        return 0;
    }

    2、

    #include <stdio.h>
    
    void deld(char x[])
    {
        int len = 0;
        while(x[len])
            len++;
        char tmp[len];
        int i = 0;
        int j = 0;
        while(x[i])
        {
            if(x[i] < '0' || x[i] > '9')
            {
                tmp[j] = x[i];
                j++;
            }
            i++;
        }
        for(i = 0; i < len; i++)
        {
            x[i] = '';
        }
        for(i = 0; i < j; i++)
        {
            x[i] = tmp[i];
        }
    }
    
    int main(void)
    {
        char str[128];
        printf("str: "); scanf("%s", str);
        deld(str);
        printf("del result: %s
    ", str);
        return 0;
    }

    3、

    #include <stdio.h>
    
    void defdi(char x[])
    {
        int len = 0;
        while(x[len])
            len++;
        int i = 0;
        while(x[i])
        {
            if(x[i] >= '0' && x[i] <= '9')
            {
                int j = i;
                while(x[j])
                {
                    x[j] = x[j + 1];
                    j++;
                }
                i--;
            }
            i++;
        }
    }
    
    int main(void)
    {
        char str[128];
        printf("str: "); scanf("%s", str);
        defdi(str);
        printf("def result: %s
    ", str);
        return 0;
    }

    4、

    #include <stdio.h>
    
    void del(char x[])
    {
        int i = 0;
        while(x[i])
        {
            if(x[i] >= '0' && x[i] <= '9')
                printf("");
            else
                putchar(x[i]);
            i++;
        }
    }
    
    int main(void)
    {
        char str[128];
        printf("str: "); scanf("%s", str);
        puts("
    =============");
        del(str);
        return 0;
    }

    5、

    #include <stdio.h>
    
    void deld(char x[])
    {
        int i = 0;
        while(x[i])
        {
            if(x[i] < '0' || x[i] > '9')
                putchar(x[i]);
            i++;
        }
    }
    
    int main(void)
    {
        char str[128];
        printf("str: "); scanf("%s", str);
        puts("
    =====================");
        deld(str);
        return 0;
    }

    6、

    #include <stdio.h>
    
    void deldi(char x[])
    {
        int len = 0;
        while(x[len])
            len++;
        char tmp[len];
        int i = 0, j = 0;
        while(x[i])
        {
            if(x[i] < '0' || x[i] > '9')
            {
                tmp[j] = x[i];
                j++;
            }
            i++;
        }
        for(i = 0; i < j; i++)
        {
            x[i] = tmp[i];
        }
        x[j] = '';
    }
    
    int main(void)
    {
        char str[128];
        printf("str: "); scanf("%s", str);
        deldi(str);
        puts("
    ==============");
        printf("del result: %s
    ", str);
        return 0;
    }

  • 相关阅读:
    diamond operator is not supported in -source 1.5
    ClassNotFoundException异常的解决方法
    serialVersionUID 的用途--转加自己的疑问
    java序列化---转
    junit类找不到的问题解决
    FastJson的基本用法----转
    sql字符串查找大小写敏感相关
    6.比较排序之快速排序
    有关ArrayList常用方法的源码解析
    5.比较排序之归并排序(非递归)
  • 原文地址:https://www.cnblogs.com/liujiaxin2018/p/14818876.html
Copyright © 2011-2022 走看看