使用一维数组模拟二维数组

如何将大小（mxn）的二维数组转换为一维数组以及如何将元素存储在一维数组中二维数组的位置[i，j]？显然，一维数组的大小是二维数组中元素的数量，即 (mxn)。如果二维数组中的元素以行优先顺序存储。然后，二维数组中索引 [i, j] 处的元素将存储在索引 k 处的一维数组中：

k = j + (i * total_no_of_columns_in_matrix)

如果二维数组中的元素以列优先顺序存储，则索引 k 的值将是

k = i + (j * total_no_of_rows_in_matrix)

有关 Row-major 和 Column-major 顺序的更多详细信息，请参阅：https://en.wikipedia.org/wiki/Row-major_order

例子：

Given 2-d array:

// array is formed in row-major order
    __________________________
   |                          |
   |1(0,0)    2(0,1)    3(0,2)|
   |                          |
   |4(1,0)    5(1,1)    6(1,2)|
   |__________________________|

// The elements in parenthesis represents the
// index of the particular element in 2-d array.

Index of element at (0,1) in 1-d array will be:
k(0,1) = 1 + 0 * 3 = 1

Index of element at (1,1) in 1-d array will be:
k(1,1) = 1 + 1 * 3 = 4

C++

// C++ program to emulate 2-d array using
// 1-d array
#include
#define n 3
#define m 3
#define max_size 100
int main()
{
 
    // Initialising a 2-d array
    int grid[n][m] = {{1, 2, 3},
                      {4, 5, 6},
                      {7, 8, 9}};
 
    // storing elements in 1-d array
    int i, j, k = 0;
    int array[max_size];
    for (i=0; i


Java
// Java program to emulate 2-d array using
// 1-d array
 
class GFG
{
    // Driver program
    public static void main(String arg[])
    {
    // Declaring number of rows and columns
        int n = 3, m = 3;
        int array[]=new int[100];
     
        // Initialising a 2-d array
        int grid[][] = {{1, 2, 3},
                        {4, 5, 6},
                        {7, 8, 9}};
     
        // storing elements in 1-d array
        int i, j, k = 0;
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < m; j++)
            {
                k = i * m + j;
                array[k] = grid[i][j];
                k++;
            }
        }
     
        // displaying elements in 1-d array
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < m; j++)
                System.out.print((array[i * m + j])+" ");
            System.out.print("\n");
        }
     
    }
}
 
// This code is contributed by Anant Agarwal.

Python3
# Python program to emulate 2-d
# array using 1-d array
 
# Declaring number of rows and columns
n = 3; m = 3
 
array = [0 for i in range(100)]
 
# Initialising a 2-d array
grid = [[1, 2, 3],
        [4, 5, 6],
        [7, 8, 9]];
 
# storing elements in 1-d array
k = 0
 
for i in range(n):
    for j in range(m):
     
        k = i*m + j
        array[k] = grid[i][j]
        k += 1
         
# displaying elements in 1-d array
for i in range(n):
    for j in range(m):
        print((array[i*m + j]), " ", end = "")
    print()
     
# This code is contributed by Anant Agarwal.

C#
// C# program to emulate 2-d array using
// 1-d array
using System;
 
class GFG
{
    // Driver program
    public static void Main()
    {
    // Declaring number of rows and columns
        int n = 3, m = 3;
        int []array=new int[100];
     
        // Initialising a 2-d array
        int [,]grid = {{1, 2, 3},
                        {4, 5, 6},
                        {7, 8, 9}};
     
        // storing elements in 1-d array
        int i, j, k = 0;
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < m; j++)
            {
                k = i * m + j;
                array[k] = grid[i, j];
                k++;
            }
        }
     
        // displaying elements in 1-d array
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < m; j++)
                Console.Write((array[i * m + j])+" ");
            Console.Write("\n");
        }
     
    }
}
 
// This code is contributed by nitin mittal

Javascript

输出：

1  2  3  
4  5  6  
7  8  9