c# - 二维数组到一维数组 C#

Question

我有两种算法可以将随机二维数组(m х n 或 m х m)转换为一维数组。我想知道是否有办法让它们在相反的方向上工作并将结果转换为保存数字顺序的一维数组。这是我的程序的完整代码和一张图片，可以看出我的两种算法是如何工作的。 enter image description here代码:

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics;
using static System.Math;


namespace MyProgram
{
    public class Program
    {
        public static void Main(string[] args)
        {
            Console.Write("Enter number of rows:");
            int n = int.Parse(Console.ReadLine());
            Console.Write("Enter number of columns:");
            int m = int.Parse(Console.ReadLine());
            int[] arr1 = new int[n * m];
            int[,] arr2 = new int[n, m];
            int choice; 
            do
            {
                Console.WriteLine("Select option:");
                Console.WriteLine("\t1: Diagonal");
                Console.WriteLine("\t2: Spiral");
                Console.WriteLine("\t3: Exit");
                Console.Write("Your selection: ");
                choice = int.Parse(Console.ReadLine());
                switch (choice)
                {
                    case 1:
                        {
                            SetArray(arr2);
                            PrintArray(arr2);
                            Diagonal(arr2, arr1); 
                            PrintArray(arr1);
                            break;
                        }
                    case 2:
                        {
                            SetArray(arr2);
                            PrintArray(arr2);
                            Spiral(arr2, arr1);
                            PrintArray(arr1);
                            break;
                        }
                }
                Console.WriteLine();
                Console.WriteLine();
            } while (choice != 5);
        }
           static void Diagonal(int[,] array2, int[] array1)
        {
            int k = 0;
            int row = 0;
            int col = 0;
            while (k < array1.Length)
            {

                array1[k] = array2[row, col];
                if ((row + col) % 2 == 0)
                {
                    if ((row == 0) && (col != array2.GetLength(1) - 1)) { col++; }
                    else
                    {
                        if (col == array2.GetLength(1) - 1) { row++; }
                        else { row--; col++; }
                    }
                }
                else
                {
                    if ((col == 0) && (row != array2.GetLength(0) - 1)) { row++; }
                    else
                    {
                        if (row == array2.GetLength(0) - 1) { col++; }
                        else { row++; col--; }
                    }

                }
                k += 1;
            }
        }

        private static void Spiral(int[,] array2, int[] array1)
        {
            int lengthX = array2.GetLength(0);
            int lengthY = array2.GetLength(1);
            int Product = lengthX * lengthY;
            int CorrectY = 0;
            int CorrectX = 0;
            int Count = 0;
            while (lengthX > 0 && lengthY > 0)
            {
                for (int j = CorrectY; j < lengthY && Count < Product; j++)
                {
                    array1[Count] = array2[CorrectX, j];
                    Count++ ;
                }
                CorrectX++;
                for (int i = CorrectX; i < lengthX && Count < Product; i++)
                {
                    array1[Count] = array2[i, lengthY - 1];
                    Count++ ;
                }
                if (lengthY > 0 && lengthX > 0) lengthY-- ;
                else break;
                for (int j = lengthY - 1; j >= CorrectY && Count < Product; j--)
                {
                    array1[Count] = array2[lengthX - 1, j];
                    Count++ ;
                }
                if (lengthY > 0 && lengthX > 0) lengthX-- ;
                else break;
                for (int i = lengthX - 1; i >= CorrectX && Count < Product; i--)
                {
                    array1[Count] = array2[i, CorrectY];
                    Count++ ;
                }

                CorrectY++;
            }

        }

        public static void SetArray(int[,] arr)
        {
            Random r = new Random();
            for (int i = 0; i < arr.GetLength(0); i++)
            {
                for (int j = 0; j < arr.GetLength(1); j++)
                {
                    arr[i, j] = r.Next(11, 99);
                }
            }
        }

        public static void SetArray(int[] arr)
        {
            Random r = new Random();
            for (int i = 0; i < arr.Length; i++)
            {

                arr[i] = r.Next(11, 99);

            }
        }

        public static void PrintArray(int[] arr)
        {
            Console.Write("print 1d array:");
            for (int i = 0; i < arr.Length; i++)
            {
                Console.Write(arr[i] + " ");
            }
            Console.WriteLine();
        }

       public static void PrintArray(int[,] arr)
        {
            Console.WriteLine("print 2d array:");
            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();
            }
        } 
    }
}

Answer 1

其实你问的很简单。只需更改您的算法方法以接收 int rows、int cols 并像这样委托(delegate)

delegate void Apply(int row, int col, int index);

然后将arr2.GetLength(0)替换为rows，将arr2.GetLength(1)替换为cols , 以及带有委托(delegate)调用的数组元素赋值。

这是更新后的 Diagonal 方法(您可以对其他方法执行相同的操作):

static void Diagonal(int rows, int cols, Apply action)
{
    int k = 0;
    int row = 0;
    int col = 0;
    int length = rows * cols;
    while (k < length)
    {
        action(row, col, k);
        if ((row + col) % 2 == 0)
        {
            if ((row == 0) && (col != cols - 1)) { col++; }
            else
            {
                if (col == cols - 1) { row++; }
                else { row--; col++; }
            }
        }
        else
        {
            if ((col == 0) && (row != rows - 1)) { row++; }
            else
            {
                if (row == rows - 1) { col++; }
                else { row++; col--; }
            }
        }
        k += 1;
    }
}

和用法:

SetArray(arr2);
PrintArray(arr2);
Diagonal(n, m, (r, c, i) => arr1[i] = arr2[r, c]);
PrintArray(arr1);
// Inverse
var arr3 = new int[n, m];
Diagonal(n, m, (r, c, i) => arr3[r, c] = arr1[i]);
PrintArray(arr3);