C++实现的银行家算法； if(request[i][j]<=need[i][j]) { if(request[i][j]<=available[j]) { available[j]=available[j]-request[i][j]; allocation[i][j]=allocation[i][j]+request[i][j]; need[i][j]=need[i][j]-request[i][j]; safe();