常见面试题

1.实现strcmp功能

#include <stdio.h>

int my_strcmp(const char *J1, const char *J2)
{
    while(*J1 == *J2)
    {
        if(*J1 == '\0')    
            return 0;

        J1++;
        J2++;
    }

    return *J1-J2;
}

int main()
{
    char str1[64] = {0},str2[64] = {0};
    
    while(1)
    {
        printf("请输入字符串1：");
        fgets(str1, 63, stdin);

        printf("请输入字符串2：");
        fgets(str2, 63, stdin);

        if(!my_strcmp(str1, str2))
        {
            printf("字符串相同\n");
        }
        else
        {
            printf("字符串不同\n");
        }
    }
    
    
    return 0;
}

2.将字符串逆序

#include <stdio.h>
#include <string.h>

void exchange(char *str, int len)
{
    char c = 0;

    for(i = 0;i < len/2;i++)
    {
        c = str[i];
        str[i] = str[len-1-i];
        str[len-1-i] = c;
    }

}

int main()
{
    char src[64] = "zhangsan";

    exchange(src, strlen(src));
    printf("%s\n",src);

    return 0;
}

3.在输入的无序整数集合中找到出现最多次数的数字,如果两个数出现次数相同，取较大的那个值

#include <stdio.h>

int main()
{
    int num,i,j;
    int times = 0;
    int arr[100]={0};
    int max_time[2]={0};
    
    scanf("%d",&num);
    for(i = 0;i < num;i++)
    {
        scanf("%d",&arr[i]);
     }

    for(i = 0;i < num;i++)
    {
        for(j = 0;j < num;j++)
        {
            if(arr[i] == arr[j])
                 times++;
        }
    
        if(max_time[1] < times)    //max_time[0]存储数值，max_time[1]储存出现次数
        {
            max_time[0] = arr[i];
            max_time[1] = times;
        }
        else if(max_time[1] == times)
        {
            if(max_time[0] < arr[i])
            {
                max_time[0] = arr[i];
                max_time[1] = times;
            }
        }
        
        times = 0;
    }

    printf("%d出现了%d次",max_time[0],max_time[1]);

    return 0;
}