华为机试C语言-VLAN资源池

题目描述：https://pycoder.blog.csdn.net/article/details/125175834

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


struct Node {
    int start;
    int end;
};

int list_index;
struct Node node_list[100];
char str_input[1000] = {0};
int vlan;

void node_build(int start, int end) {
    node_list[list_index].start = start;
    node_list[list_index].end = end;
    list_index++;
}

void str_build(int start, int end, int target) {
    if ((start >= target) || (end <= target)) {
        if (start == target) start = target + 1;
        if (end == target) end = target - 1;

        if (start > end) {
            return;
        }

        node_build(start, end);
        return;
    }

    node_build(start, target - 1);
    node_build(target + 1, end);
}

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

    if (strchr(str, '-') != NULL) {
        sscanf(str, "%d-%d", &start, &end);
    } else {
        sscanf(str, "%d", &start);
        end = start;
    }

    str_build(start, end, vlan);
}

int myCmp(const void* a, const void* b) {
    struct Node* aa = (struct Node*)a;
    struct Node* bb = (struct Node*)b;

    return aa->start - bb->start;
}

void myPrintf(int i, int flag) {
    if (node_list[i].start == node_list[i].end) {
        printf("%d", node_list[i].start);
    } else {
        printf("%d-", node_list[i].start);
        printf("%d", node_list[i].end);
    }

    if (flag == 1) {
        printf(",");
    }
}

int main(void) {
    list_index = 0;

    gets(str_input);
    scanf("%d", &vlan);

    printf("%s %d\n", str_input, vlan);

    char* tmp = strtok(str_input, ",");
    str_parse(tmp);
    while (1) {
        tmp = strtok(NULL, ",");
        if (tmp == NULL) break;
        str_parse(tmp);
    }

    qsort(node_list, list_index, sizeof(node_list[0]), myCmp);

    for (int i = 0; i < list_index - 1; i++) {
        myPrintf(i, 1);
    }
    myPrintf(list_index - 1, 0);

    return 0;
}