C#笔记之把二维数组转成一位数组

103 阅读 0 评论 68 点赞

我是靠谱客的博主耍酷手套，这篇文章主要介绍C#笔记之把二维数组转成一位数组，现在分享给大家，希望可以做个参考。

需要达到的效果是：
1、把二维数组的内容按顺序存进一位数组里面；
2、二维数组的使用方法一样可以在一位数组里面使用；
3、要有替换、查找的功能。

具体代码如下：

复制代码

using UnityEngine;

public class ChaZhaoAndTiHuan<T>
{
    int[,] num = new int[3, 4] { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 } };
    private T[] nums;
    private int rowCount;
    private int colCount;
    /// <summary>
    /// 转换
    /// </summary>
    /// <param name="nu"></param>
    private void ZhuanHuan(T[,] nu)
    {
        int row, col, count;
        count = 0;
        rowCount = row = nu.GetLength(0);//获取行Count
        colCount = col = nu.GetLength(1);//获取列Count
        nums = new T[row * col];
        for (int i = 0; i < row; i++)
        {
            for (int j = 0; j < col; j++, count++)
            {
                nums[count] = nu[i, j];
            }
        }
    }
    /// <summary>
    /// 替换（注：行和列的索引从0开始）
    /// </summary>
    /// <param name="hang"></param>
    /// <param name="lie"></param>
    /// <param name="number"></param>
    private void Replace(int row, int col, T number)
    {
        if (row > rowCount || col > colCount)
        {
            Debug.LogError("您输入的索引已越界，请重新输入！");
            return;
        }
        nums[row * colCount + col] = number;
    }
    /// <summary>
    /// 查找（注：行和列的索引从0开始）
    /// </summary>
    /// <param name="hang"></param>
    /// <param name="lie"></param>
    /// <returns></returns>
    private T Lookup(int row, int col)
    {
        if (row > rowCount || col > colCount)
        {
            Debug.LogError("您输入的索引已越界，请重新输入！");
            return default;
        }
        return nums[row * colCount + col];
    }
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
using UnityEngine;

public class ChaZhaoAndTiHuan<T>
{
    int[,] num = new int[3, 4] { { 1, 2, 3, 4 }, { 5, 6, 7, 8 }, { 9, 10, 11, 12 } };
    private T[] nums;
    private int rowCount;
    private int colCount;
    /// <summary>
    /// 转换
    /// </summary>
    /// <param name="nu"></param>
    private void ZhuanHuan(T[,] nu)
    {
        int row, col, count;
        count = 0;
        rowCount = row = nu.GetLength(0);//获取行Count
        colCount = col = nu.GetLength(1);//获取列Count
        nums = new T[row * col];
        for (int i = 0; i < row; i++)
        {
            for (int j = 0; j < col; j++, count++)
            {
                nums[count] = nu[i, j];
            }
        }
    }
    /// <summary>
    /// 替换（注：行和列的索引从0开始）
    /// </summary>
    /// <param name="hang"></param>
    /// <param name="lie"></param>
    /// <param name="number"></param>
    private void Replace(int row, int col, T number)
    {
        if (row > rowCount || col > colCount)
        {
            Debug.LogError("您输入的索引已越界，请重新输入！");
            return;
        }
        nums[row * colCount + col] = number;
    }
    /// <summary>
    /// 查找（注：行和列的索引从0开始）
    /// </summary>
    /// <param name="hang"></param>
    /// <param name="lie"></param>
    /// <returns></returns>
    private T Lookup(int row, int col)
    {
        if (row > rowCount || col > colCount)
        {
            Debug.LogError("您输入的索引已越界，请重新输入！");
            return default;
        }
        return nums[row * colCount + col];
    }
}