C#银行家算法(考虑安全问题)

using System;
using System.Collections.Generic;
using System.Text;
 
namespace BankerAlgorithm
{
    class Program
    {
        /*@ n: the number of processes
         *@ m: the number of available resources of each type
         *@ Available: A vector of length m indicates the numnber of available resources of each type
         *@ Max: An n * m matrix defines the maximum demand of each process
         *@ Allocation: An n * m matrix defines the number of resources of each type currently allocated to each process.
         *@ Need: An n * m matrix indicates the remaining resource need of each process
         */
        private int m;
        private int n;
        private int[] Available;
        private int[][] Max;
        private int[][] Allocation;
        private int[][] Need;
        private readonly char[] sprit ={ ' ', '\t', '\n' };
 
        Program()
        {
            Initialize();
        }
 
        //get data from standard input
 

        public void Initialize()
        {
           
           
            Console.Write("Please enter the number of processes (n) : ");
            n=Int32.Parse(Console.ReadLine());
            Console.Write("Please enter the number of available resources of each type (m) : ");
            m = Int32.Parse(Console.ReadLine());
 
            Available=new int[m];
            Console.WriteLine("Enter the available resources of each type.(Available)");
            ReadOneDimension(Available);
 
            Max=new int[n][];
            for (int i = 0; i < n; i++)
               Max[i] = new int[m];
            Allocation = new int[n][];
            for (int i = 0; i < n; i++)
                Allocation[i] = new int[m];
            Need = new int[n][];
            for (int i = 0; i < n; i++)
                Need[i] = new int[m];
 
            Console.WriteLine("Enter the matrix which indicates the maximum demand of each process.(Max)");
            ReadMaxtrix(Max);
            Console.WriteLine("Enter the matrix which indicates the number of resources of each type currently allocated to each process.(Allocation)");
            ReadMaxtrix(Allocation);
 
            //because Need[i,j] = Max[i,j] - Allocation[i,j]