C语言基础编程题（字符串训练）

1.请编写一个C函数，该函数将一个字符串逆序

#include <stdio.h>

#define MAX_SIZE 10

void str_invert(char *src) {
    int len = 0;

    while (*(src+len) != 0)
        len++;

    for (int i = 0; i < len/2; i++) {
        *(src+i) = *(src+i) + *(src+(len-1-i));
        *(src+(len-1-i)) = *(src+i) - *(src+(len-1-i));
        *(src+i) = *(src+i) - *(src+(len-1-i));
    }
}

int main() {
    char str[MAX_SIZE] = "Sakura";

    str_invert(str);
    printf("%s", str);

    return 0;
}

2.请编写一个C函数，该函数可以将一个整数转为任意进制的字符串输出

#include <stdio.h>

#define MAX_SIZE 16

void transform(int x, int n, char dest[MAX_SIZE]);

int main() {
    int x = (10 * 256) + (11 * 16) + (12 * 1);
    int n = 16;//between 2 and 46
    char str[MAX_SIZE];

    transform(x, n, str);

    printf("%d(10) = %s(%d)", x, str, n);

    return 0;
}

void transform(int x, int n, char dest[MAX_SIZE]) {
    int i = 0, tmp, len;

    while (x) {
        tmp = x % n;
        dest[i] = (tmp >= 0 && tmp <= 9) ? (tmp + 48) : (tmp + 55);//0-9:0-9, 10-45:A-Z
        x = x / n;
        i++;
    }
    len = i;
    dest[len] = 0;

    /*invert*/
    for (i = 0; i < len/2; i++) {
        tmp = dest[len-1-i];
        dest[len-1-i] = dest[i];
        dest[i] = tmp;
    }
}

3.输入一个字符串，计算字符串中子串出现的次数

#include <stdio.h>

#define MAX_SIZE 100

int pattern_matching(char *m_str, char *p_str) {
    int count = 0;
    int i = 0, j, tmp;

    while (*(m_str+i) != 0) {
        tmp = i+1;
        j = 0;

        while (*(p_str+j) != 0) {
            if (*(m_str+i) == *(p_str+j)) {
                i++;
                j++;
            }
            else {
                break;
            }
        }

        if (*(p_str+j) == 0)
            count++;

        i = tmp;
    }

    return count;
}

int main() {
    char main_string[MAX_SIZE] = "abababa";
    char pattern_string[MAX_SIZE] = "aba";

    printf("%d", pattern_matching(main_string, pattern_string));

    return 0;
}

4.编写一个函数，将句子中的单词位置倒置，而不改变单词内部结构

#include <stdio.h>

#define MAX_SIZE 100

void invert_word(char *str, int start, int end);
int is_letter(char c);
void invert_sentence(char *str);

int main() {
    char str[MAX_SIZE] = "light and shadow.";

    invert_sentence(str);
    printf("%s", str);

    return 0;
}

void invert_word(char *str, int start, int end) {
    int tmp;

    for (int i = start; i <= (end+start)/2; i++) {
        tmp = str[i];
        str[i] = str[end-(i-start)];
        str[end-(i-start)] = tmp;
    }
}

int is_letter(char c) {
    return ((c >= 65 && c <= 90) || (c >= 97 && c <= 122)) ? 1 : 0;
}

void invert_sentence(char *str) {
    int i = 0, j;
    while (*(str+i) != 0) {
        j = i + 1;
        while (is_letter(*(str+j))) {
            j++;
        }
        invert_word(str, i, j-1);
        i = j + 1;
    }
    invert_word(str, 0, j-1);
}

5.输入一个字符串，同时输入帧头和帧尾，将该字符串中合法的帧识别出来

例如：帧头和帧尾分别是"head"和"tail"，字符串"asdheadfghjkltail"中"headfghjkltail"是合法帧。

#include <stdio.h>

#define MAX_SIZE 100

enum POSITION {
    P_START = 0, P_END = 1
};

int pattern_matching(char *m_str, char *p_str, enum POSITION tag);//return the start position of pattern string in main string when tag = P_START, return end position when tag = P_END
void str_find(char *dest, char *src, char *head, char *tail);

int main() {
    char str[MAX_SIZE] = "asdheadfghjkltail";
    char head[MAX_SIZE] = "head";
    char tail[MAX_SIZE] = "tail";
    char target[MAX_SIZE];

    str_find(target, str, head, tail);

    printf("%s", target);

    return 0;
}

/*return the start position of pattern string in main string when tag = P_START, return end position when tag = P_END*/
int pattern_matching(char *m_str, char *p_str, enum POSITION tag) {
    int i = 0, j, tmp;
    int all_same;

    while (*(m_str+i) != 0) {
        tmp = i+1;
        all_same = 1;
        j = 0;

        while (*(p_str+j) != 0) {
            if (*(m_str+i) == *(p_str+j)) {
                i++;
                j++;
            }
            else {
                all_same = 0;
                break;
            }
        }

        if (all_same == 1) {
            return (tag == P_START) ? tmp-1 : i-1;
        }

        i = tmp;
    }

    return -1;
}

void str_find(char *dest, char *src, char *head, char *tail) {
    int begin, end;
    int i, k = 0;

    begin = pattern_matching(src, head, P_START);
    end = pattern_matching(src, tail, P_END);

    for (i = begin; i <= end; i++) {
        dest[k++] = src[i];
    }
    dest[k] = 0;
}