2048核心算法

2048核心算法
直接上源码

private static int[,] Up(int[,] map)  //上移
        {
            for (int j = 0; j < map.GetLength(1); j++)
            {
                int[] array = new int[map.GetLength(0)];
                for (int i = 0; i < map.GetLength(0); i++)
                {
                    array[i] = map[i, j];
                }
                array = Merge(array);
                for (int i = 0; i < map.GetLength(0); i++)
                {
                    map[i, j] = array[i];
                }
            }
            return map;
        }

        private static int[,] Down(int[,] map)  //下移
        {
            for (int j = 0; j < map.GetLength(1); j++)
            {
                int[] array = new int[map.GetLength(0)];
                for (int i = map.GetLength(0)-1; i >=0; i--)
                {
                    array[map.GetLength(0)-1-i] = map[i, j];
                }
                array = Merge(array);
                for (int i = map.GetLength(0)-1; i >= 0; i--)
                {
                    map[i, j] = array[map.GetLength(0) - 1 - i];
                }
            }
            return map;
        }

        private static int[,] Left(int[,] map)  //左移
        {
            int[] arr = new int[map.GetLength(0)];
            for (int j = 0; j < map.GetLength(1); j++)
            {
                for (int i = 0; i < map.GetLength(1); i++)
                {
                    arr[i] = map[j, i];
                }
                arr = Merge(arr);
                for(int i = 0; i < map.GetLength(1); i++)
                {
                    map[j, i] = arr[i];
                }
            }
            return map;
        }

        private static int[,] Right(int[,] map)  //右移
        {
            int[] arr = new int[map.GetLength(1)];
            for (int i = 0; i < map.GetLength(0); i++)
            {  
                for (int j = map.GetLength(1) - 1; j >= 0; j--)
                {
                    arr[map.GetLength(1) - 1 - j] = map[i, j];
                }
                arr = Merge(arr);
                for (int j = map.GetLength(1) - 1; j >= 0; j--)
                {
                    map[i, j] = arr[map.GetLength(1) - 1 - j];
                }
            }
            return map;
        }

        private static int[] RemoveZero(int[] arr)  //去0
        {
            int k = 0;
            int[] array = new int[arr.Length];
            for(int i = 0; i < arr.Length; i++)
            {
                if (arr[i] != 0)
                {
                    array[k] = arr[i];
                    k++;
                }
            }
            return array;
        }

        private static int[] Merge(int[] arr)       //合并
        {
            arr = RemoveZero(arr);
            for(int i =0; i < arr.Length-1; i++) 
            {
                if (arr[i]!=0 && arr[i] == arr[i + 1])     //可加一个判断是否为0；不加也一样
                {
                    arr[i] *= 2;
                    arr[i + 1] = 0;
                    i++;
                }
            }
            arr = RemoveZero(arr);
            return arr;
        }

        private static void Print(int[,] map)
        {
            for (int i = 0; i < map.GetLength(0); i++)  //GetLength(0)拿行长度；GetLength(1)拿列长度
            {
                for (int j = 0; j < map.GetLength(1); j++)
                {
                    Console.Write("\t" + map[i, j]);
                }
                Console.WriteLine();
            }
            Console.WriteLine();
        }

        private static void Move(int[,] map,MoveDirection moveDirection)  //枚举，限定取值，还要写个类
        {
            if((moveDirection & MoveDirection.Up) == MoveDirection.Up)  //至于为什么是这条件，把二进制写出来，然后按位与
            {
                Up(map);
                Print(map);
            }
            if ((moveDirection & MoveDirection.Down) == MoveDirection.Down)  
            {
                Down(map);
                Print(map);
            }
            if ((moveDirection & MoveDirection.Left) != 0)            //这个条件也可以
            {
                Left(map);
                Print(map);
            }
            if ((moveDirection & MoveDirection.Rigth) !=0)
            {
                Right(map);
                Print(map);
            }
            /* switch (moveDirection)
             {
                 case MoveDirection.Up:
                     Up(map);
                     break;
                 case MoveDirection.Down:
                     Down(map);
                     break;
                 case MoveDirection.Left:
                     Left(map);
                     break;
                 case MoveDirection.Rigth:
                     Right(map);
                     break;
             }*/
        }

        static void Main()
        {

            int[,] map = new int[4, 4]
                {
                    {8,0,2,4 },
                    {4,4,8,2 },
                    {2,4,2,4 },
                    {0,2,2,2 }
                };
            Print(map);
            //map = Up(map);
            Move(map,MoveDirection.Up | MoveDirection.Left);  //选择多个枚举用 | （按位或  ）
            //Print(map);
            //map = Down(map);
            //Move(map, MoveDirection.Down);
            //Print(map);
            //map = Left(map);
            //Move(map, MoveDirection.Left);
            //Print(map);
            //map = Right(map);
            //Move(map, MoveDirection.Rigth);
            //Print(map);



            /* int[] arr = new int[4] { 4, 0, 2, 0 };
             arr = RemoveZero(arr);
             for (int i = 0; i < arr.Length; i++)
             {
                 Console.WriteLine(arr[i]);
             }*/


        }