class Program
    {
        static void Main(string[] args)
        {
            Console.WriteLine("第一題");
            int[] arrA = { 1, 3, 4, 5, 6 };
            string[] arrB = { "7", "8", "9" };
            int[] arrC = new int[arrA.Length + arrB.Length];

            for (int i = 0; i < arrA.Length + arrB.Length; i++)
            {

                if (i < arrA.Length)
                {
                    arrC[i] = arrA[i];
                }
                else
                {
                    arrC[i] = Convert.ToInt32(arrB[i - arrA.Length]);
                }
                // Console.Write(arrC[i]);

            }

            foreach (int arrC1 in arrC)
            {
                Console.WriteLine(arrC1);
            }



            Console.WriteLine("\n\n第二題");

            int[] arrD = new int[19];
            int j = 0;
            for (int i = 0; i < arrD.Length; i++)
            {
                if (i % 2 == 0 && j < arrC.Length)
                {
                    arrD[i] = arrC[arrC.Length - 1 - j];
                    j++;
                }
            }

            foreach (int arrD1 in arrD)
            {
                Console.Write(arrD1 + " ");
            }

            //練
            //-------第一題----------------數(shù)組相加
            int[] arrA = { 1, 3, 4, 5, 6 };
            string[] arrB = { "7", "8", "9" };


            int[] arrC = new int[arrA.Length + arrB.Length];//降低藕合性蕾域；
            for (int i = 0; i < arrC.Length; i++)
            {
                if (i < arrA.Length)//判斷下標小于A數(shù)組污筷，直接賦值
                {
                    arrC[i] = arrA[i];
                }
                else
                {//判斷下標超過A數(shù)組后，強轉成整型拒啰；注意數(shù)組B的下標扎附，要從0開始膨处；
                    arrC[i] = Convert.ToInt32(arrB[i - arrA.Length]);
                }
                // Console.Write(arrC[i]+" ");

            }

            foreach (int arrC1 in arrC)
            {
                Console.Write(arrC1 + " ");
            }
            Console.Write("\n\n");


            //-------第二題----------------偶數(shù)位倒序

            int[] arrD = new int[19];//固定數(shù)組D的長度健爬；
            int index = arrC.Length - 1;//定義數(shù)組C的長度賦值埋泵；
            for (int i = 0; i < arrD.Length; i++)
            {
                if (i % 2 == 0 && index >= 0)
                {//判斷偶數(shù)位幔欧；注意下標不能取到負數(shù)罪治；
                    arrD[i] = arrC[index];//倒序下標
                    index--;//下標迭代遞減；注意不能小于0礁蔗；否則溢出觉义；
                }
            }
            foreach (int arrD1 in arrD)
            {
                Console.Write(arrD1 + " ");
            }



            //----------二維數(shù)組-----------
            //練1
            int[,] arr = new int[3, 4] { { 0, 1, 2, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 } };
            for (int i = 0; i < 3; i++)
            {
                for (int j = 0; j < 4; j++)
                {
                    Console.WriteLine("arr[{0},{1}]={2}", i, j, arr[i, j]);
                }
                Console.WriteLine("\n");
            }

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

            //練習
            //第一題 最大排前面 最小排后面

            int[] Arr = new int[10];
            // int shuru =Convert.ToInt32( Console.ReadLine());
            Console.WriteLine("請輸入十個數(shù)，從小排到大 ");
            for (int i = 0; i < Arr.Length; i++)
            {
                Arr[i] = Convert.ToInt32(Console.ReadLine());
            }
            int arrMax = Arr[0];
            int arrMin = Arr[0];
            for (int i = 0; i < Arr.Length; i++)
            {
                if (arrMax < Arr[i])
                {
                    arrMax = Arr[i];
                }
                if (arrMin > Arr[i])
                {
                    arrMin = Arr[i];
                }
            }
            //int[] arrF=new int[Arr.Length];
            for (int i = 0; i < Arr.Length; i++)
            {
                if (Arr[i] == arrMax)
                {
                    int indexMax = i;
                    int temp = Arr[0];
                    Arr[0] = Arr[indexMax];
                    Arr[indexMax] = temp;
                }
                if (Arr[i] == arrMin)
                {
                    int indexMin = i;
                    int temp1 = Arr[Arr.Length - 1];
                    Arr[Arr.Length - 1] = Arr[indexMin];
                    Arr[indexMin] = temp1;
                }
            }

            Console.Write("\n最大最小 ");
            foreach (int Arr1 in Arr)
            {
                Console.Write(Arr1 + " ");
            }






            //倒序
            for (int i = 0; i < Arr.Length; i++)
            {
                for (int j = i; j < Arr.Length; j++)
                {
                    if (Arr[i] > Arr[j])
                    {
                        int temp = Arr[i];
                        Arr[i] = Arr[j];
                        Arr[j] = temp;
                    }
                }
            }


            Console.Write("\n排序后 ");
            foreach (int Arr2 in Arr)
            {
                Console.Write(Arr2 + " ");
            }


            Console.ReadKey();
        
        }
    }