class Program
    {
        static void Main(string[] args)
        {
                //第一種聲明方式；
            int[,] arr = new int[2, 3];//初始化聲明2行3列二位數(shù)組的長度灵临；

            //第二種聲明方式；
            int[,] arr2 = new int[2, 3] { { 1, 2, 3 }, { 4, 5, 6 } };//聲明數(shù)組長度并初始化它具體的值；

            //第三種聲明方式谈息；
            int[,] arr3 = { 
                          { 1, 2, 3 }, 
                          { 4, 5, 6 },
                          { 7, 8, 9 }
        }; 
        //聲明二位數(shù)組并初始化直接賦值业踏；不用聲明具體長度以及實(shí)例化乙帮，行數(shù)可以變；列數(shù)不變腰湾；列數(shù)變，每列都要變疆股；
            Console.WriteLine(arr3.Length);//長度是值數(shù)組的每一個(gè)元素之和=行*列费坊；
            Console.WriteLine(arr3[2, 1]);//二位數(shù)相應(yīng)下標(biāo)從0號(hào)位開始；相關(guān)取法和一維數(shù)組一樣旬痹；注意寫法arr[0附井，2]；
            arr3[0, 2] = 888;//可以重新賦值唱凯； 
            Console.WriteLine(arr3[0, 2]);

            for (int i = 0; i < 3; i++)
            {
                for (int j = 0; j < 3; j++)
                {
                    Console.Write(arr3[i, j] + " ");
                }
                Console.Write("\n");
            }


            //練
            const int Line = 4;//行數(shù)
            const int List = 5;//列數(shù)
            int[,] arr = new int[Line, List] { { 1, 2, 3, 0, 8 }, { 4, 5, 6, 0, 8 }, { 7, 8, 9, 0, 8 }, { 1, 2, 3, 0, 8 }, };
            for (int i = 0; i < Line; i++)
            {
                for (int j = 0; j < List; j++)
                {
                    Console.Write(arr[i, j] + " ");
                }
                Console.WriteLine();
            }


            //練
            int[,] arr1 = new int[2, 3] { { 1, 2, 3 }, { 4, 5, 6 } };
            for (int i = 0; i < 2; i++)
            {
                for (int j = 0; j < 3; j++)
                {
                    Console.Write(arr1[i, j] + " ");
                }
                Console.WriteLine();
            }



            //練 遍歷數(shù)組 簡易方法//arr.getlength();
            int[,] arr = new int[2, 3] { { 1, 2, 3 }, { 4, 5, 6 } };

            for(int i=0;i<arr.GetLength(0);i++){
                for (int j = 0; j < arr.GetLength(1);j++ )
                {
                    Console.Write(arr[i,j]+" ");
                }
                Console.WriteLine();
            }
            Console.WriteLine();
            int js = 0;
            foreach(int arr1 in arr){
                Console.Write(arr1+" ");
                js++;
                if(js%3==0){
                    Console.WriteLine();
                }
               
            //}

            //練
            int[,] arr= new int[3,4]{{1,2,3,4},{5,6,7,8},{9,10,11,12}};
            for(int i=0;i<arr.GetLength(0);i++){
                for (int j = 0; j < arr.GetLength(1);j++ )
                {
                    Console.Write(arr[i,j]+" ");               
                }
                Console.WriteLine();
            }

            //arr[2, 3] = 88;

            
            //練習(xí)
            //1.1 1.2：第一題
            //3行3列的數(shù)
            int[,] arr1=new int[3,3];
            int js = 0;
            int sum = 0;
            for(int i=0;i<arr1.GetLength(0);i++){
                for (int j = 0; j < arr1.GetLength(1);j++ )
                {
                    js++;
                    arr1[i, j] = js;
                    if(i+j==2||i==j){
                        sum += arr1[i, j];
                    }
                }
            }

            foreach(int arra in arr){
                Console.Write(arra+" ");
               js++;
                if(js%3==0){
                    Console.WriteLine();
                }
            }

            Console.WriteLine("對(duì)角線之和為：{0}",sum);
            Console.WriteLine();
           
            //第二題
            //2.1：找出這個(gè)二維數(shù)組里最大和最小的數(shù)組
           
            int[,] Arr = {
                { 26, 23, 156, 25 }, 
                { 11, 833, 52, 117 },
                { 114, 33, 542, 17 }
                         };
            int arrMax=Arr[0,0];
            int arrMin=Arr[0,0];
            for (int i = 0; i < Arr.GetLength(0);i++ )
            {
                for(int j=0;j<Arr.GetLength(1);j++){
                    if(arrMax<Arr[i,j]){//判斷最大值
                        arrMax=Arr[i,j];
                    }

                    if (arrMin > Arr[i,j])//判斷最小值
                    {
                        arrMin = Arr[i,j];
                    }
                }
               
            }
            Console.WriteLine("最大值為{0}\n最小值為{1}\n", arrMax, arrMin);

            //2.2：對(duì)這個(gè)二維數(shù)組進(jìn)行從小到到的排序顯示羡忘，如這樣{{1，2磕昼，3}卷雕，{4，5票从，6}漫雕，{7，8峰鄙，9}}浸间；
                 //------------二維數(shù)組直接排序------------------
            for (int i = 0; i < Arr.GetLength(0); i++)
            {
                for (int j = 0; j < Arr.GetLength(1); j++)
                {
                    for (int k = 0; k < Arr.GetLength(0); k++)
                    {
                        for (int q = 0; q < Arr.GetLength(1); q++)
                        {
                            if (Arr[i, j] < Arr[k, q])
                            {
                                int temp = Arr[i, j];
                                Arr[i, j] = Arr[k, q];
                                Arr[k, q] = temp;
                            }
                        }
                    }

                }
            }

            //------------二維數(shù)組變成一維數(shù)組；再排序轉(zhuǎn)換成二維數(shù)組------------------
            int[] arrPaixu=new int[Arr.Length];
            int js_1 = 0;
            for (int i = 0; i < Arr.GetLength(0); i++)
            {
                for (int j = 0; j < Arr.GetLength(1); j++)
                {
                    arrPaixu[js_1] = Arr[i, j];
                    js_1++;
                }
            }

            for (int i = 0; i < arrPaixu.Length; i++)
            {
                for (int j = 0; j < arrPaixu.Length; j++)
                {
                    if (arrPaixu[i] < arrPaixu[j])
                    {
                        int temp = arrPaixu[i];
                        arrPaixu[i] = arrPaixu[j];
                        arrPaixu[j] = temp;
                    }
                }

            }
            js_1 = 0;
            for (int i = 0; i < Arr.GetLength(0); i++)
            {
                for (int j = 0; j < Arr.GetLength(1); j++)
                {
                    Arr[i, j]=arrPaixu[js_1];
                    js_1++;
                }
            }

            int js1 = 0;
            foreach (int arr22 in Arr)
            {
                Console.Write(arr22 + "     ");
                js1++;
                if (js1 % 4 == 0)
                {
                    Console.WriteLine();
                }
            }



            Console.ReadKey();
        
        }
    }