银行家算法：Python、C++、Java 多语言实现资源安全状态判断与安全序列输出

以下是使用 Python 语言实现的银行家算法： ```python def banker_algorithm(): resource = list(map(int, input().split())) processes = [] for _ in range(4): process_info = input().split() claim = list(map(int, process_info[1:4])) allocation = list(map(int, process_info[4:])) processes.append([process_info[0], claim, allocation]) available = [resource[i] - sum([p[2][i] for p in processes]) for i in range(3)] finish = [False] * 4 work = available.copy() safe_sequence = [] while False in finish: found = False for i, process in enumerate(processes): if not finish[i] and all(work[j] >= process[1][j] - process[2][j] for j in range(3)): work = [work[j] + process[2][j] for j in range(3)] finish[i] = True safe_sequence.append(process[0]) found = True if not found: print("false") return print(" ".join(safe_sequence)) banker_algorithm() ``` 以下是使用 C++语言实现的银行家算法： ```cpp #include <iostream> #include <vector> #include <string> using namespace std; bool isSafe(vector<int> resource, vector<vector<int>> processes) { vector<int> available; vector<bool> finish(processes.size(), false); vector<int> work; for (int i = 0; i < 3; i++) { int sum_allocated = 0; for (const auto& process : processes) { sum_allocated += process[2][i]; } available.push_back(resource[i] - sum_allocated); } work = available; while (true) { bool found = false; for (size_t i = 0; i < processes.size(); i++) { if (!finish[i] && all_of(processes[i][1].begin(), processes[i][1].end(), [&](int claim, size_t j) { return work[j] >= claim - processes[i][2][j]; })) { for (int j = 0; j < 3; j++) { work[j] += processes[i][2][j]; } finish[i] = true; found = true; } } if (!found) { return false; } bool allFinished = true; for (const auto& f : finish) { if (!f) { allFinished = false; break; } } if (allFinished) { return true; } } } void printSafeSequence(vector<string> processNames, vector<bool> finish) { for (size_t i = 0; i < finish.size(); i++) { if (finish[i]) { cout << processNames[i] << " "; } } cout << endl; } int main() { vector<int> resource(3); cin >> resource[0] >> resource[1] >> resource[2]; vector<vector<int>> processes(4, vector<int>(7)); vector<string> processNames(4); for (int i = 0; i < 4; i++) { cin >> processNames[i]; for (int j = 0; j < 7; j++) { cin >> processes[i][j]; } } if (isSafe(resource, processes)) { vector<bool> finish(4, false); printSafeSequence(processNames, finish); } else { cout << "false" << endl; } return 0; } ``` 以下是使用 Java 语言实现的银行家算法： ```java import java.util.Scanner; public class BankerAlgorithm { public static boolean isSafe(int[] resource, int[][] processes) { int[] available = new int[3]; boolean[] finish = new boolean[4]; int[] work = new int[3]; for (int i = 0; i < 3; i++) { int sumAllocated = 0; for (int[] process : processes) { sumAllocated += process[2 * i + 4]; } available[i] = resource[i] - sumAllocated; } System.arraycopy(available, 0, work, 0, 3); while (true) { boolean found = false; for (int i = 0; i < 4; i++) { if (!finish[i] && allResourcesAvailable(work, processes[i])) { for (int j = 0; j < 3; j++) { work[j] += processes[i][2 * j + 4]; } finish[i] = true; found = true; } } if (!found) { return false; } boolean allFinished = true; for (boolean f : finish) { if (!f) { allFinished = false; break; } } if (allFinished) { return true; } } } public static boolean allResourcesAvailable(int[] work, int[] process) { for (int i = 0; i < 3; i++) { if (work[i] < process[2 * i] - process[2 * i + 1]) { return false; } } return true; } public static void printSafeSequence(String[] processNames, boolean[] finish) { for (int i = 0; i < 4; i++) { if (finish[i]) { System.out.print(processNames[i] + " "); } } System.out.println(); } public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int[] resource = new int[3]; resource[0] = scanner.nextInt(); resource[1] = scanner.nextInt(); resource[2] = scanner.nextInt(); int[][] processes = new int[4][7]; String[] processNames = new String[4]; for (int i = 0; i < 4; i++) { processNames[i] = scanner.next(); for (int j = 0; j < 7; j++) { processes[i][j] = scanner.nextInt(); } } if (isSafe(resource, processes)) { boolean[] finish = new boolean[4]; printSafeSequence(processNames, finish); } else { System.out.println("false"); } scanner.close(); } } ``` ######[AI写代码神器 | 1627点数解答 | 2024-11-18 16:34:36]