用C语言写一个银行家算法

好的，以下是一个简单的C语言实现银行家算法的示例代码，希望对您有帮助：

#include <stdio.h>

#define MAX_PROCESS_NUM 10
#define MAX_RESOURCE_NUM 10

int available[MAX_RESOURCE_NUM]; // 可用资源数量
int max[MAX_PROCESS_NUM][MAX_RESOURCE_NUM]; // 最大需求量
int allocation[MAX_PROCESS_NUM][MAX_RESOURCE_NUM]; // 分配量
int need[MAX_PROCESS_NUM][MAX_RESOURCE_NUM]; // 还需求量
int work[MAX_RESOURCE_NUM]; // 当前可用资源数量
int finish[MAX_PROCESS_NUM]; // 标记每个进程是否完成

// 初始化资源数量、最大需求量、分配量、还需求量
void init() {
    int resource_num, process_num;
    printf("请输入资源数：");
    scanf("%d", &resource_num);
    printf("请输入进程数：");
    scanf("%d", &process_num);

    printf("请依次输入每种资源的可用数量：\n");
    for (int i = 0; i < resource_num; i++) {
        scanf("%d", &available[i]);
        work[i] = available[i];
    }

    printf("请依次输入每个进程的最大需求量：\n");
    for (int i = 0; i < process_num; i++) {
        printf("进程 %d：", i);
        for (int j = 0; j < resource_num; j++) {
            scanf("%d", &max[i][j]);
        }
    }

    printf("请依次输入每个进程已分配量：\n");
    for (int i = 0; i < process_num; i++) {
        printf("进程 %d：", i);
        for (int j = 0; j < resource_num; j++) {
            scanf("%d", &allocation[i][j]);
            need[i][j] = max[i][j] - allocation[i][j];
            work[j] -= allocation[i][j];
        }
    }
}

// 判断当前状态是否安全
int is_safe(int process_num, int resource_num) {
    int sequence[MAX_PROCESS_NUM], safe = 0, count = 0;
    for (int i = 0; i < process_num; i++) {
        finish[i] = 0;
    }

    while (count < process_num) {
        safe = 0;
        for (int i = 0; i < process_num; i++) {
            if (!finish[i]) {
                int j;
                for (j = 0; j < resource_num; j++) {
                    if (need[i][j] > work[j]) {
                        break;
                    }
                }
                if (j == resource_num) {
                    for (int k = 0; k < resource_num; k++) {
                        work[k] += allocation[i][k];
                    }
                    finish[i] = 1;
                    sequence[count++] = i;
                    safe = 1;
                }
            }
        }
        if (!safe) {
            break;
        }
    }

    if (count == process_num) {
        printf("安全序列为：");
        for (int i = 0; i < process_num; i++) {
            printf("%d ", sequence[i]);
        }
        printf("\n");
        return 1;
    } else {
        printf("当前状态不安全！\n");
        return 0;
    }
}

// 请求资源
void request_resource(int process_num, int resource_num) {
    int process_id, request_num[MAX_RESOURCE_NUM];
    printf("请输入请求资源的进程编号：");
    scanf("%d", &process_id);
    printf("请输入请求的各种资源数量：");
    for (int i = 0; i < resource_num; i++) {
        scanf("%d", &request_num[i]);
    }

    for (int i = 0; i < resource_num; i++) {
        if (request_num[i] > need[process_id][i]) {
            printf("请求资源量大于还需求量，请求失败！\n");
            return;
        }
        if (request_num[i] > available[i]) {
            printf("请求资源量大于可用资源量，进程 %d 将等待！\n", process_id);
            return;
        }
    }

    for (int i = 0; i < resource_num; i++) {
        available[i] -= request_num[i];
        allocation[process_id][i] += request_num[i];
        need[process_id][i] -= request_num[i];
        work[i] = available[i];
    }

    if (is_safe(process_num, resource_num)) {
        printf("请求成功，进程 %d 获得所需资源！\n", process_id);
    } else {
        printf("请求失败，进程 %d 将回退申请资源！\n", process_id);
        for (int i = 0; i < resource_num; i++) {
            available[i] += request_num[i];
            allocation[process_id][i] -= request_num[i];
            need[process_id][i] += request_num[i];
            work[i] = available[i];
        }
    }
}

int main() {
    int process_num, resource_num;
    init();
    is_safe(process_num, resource_num);
    request_resource(process_num, resource_num);
    return 0;
}

以上是一个简单的银行家算法的实现，希望能够帮助到您！