多维数组使用示例

多维数组使用示例

    多维数组在实际使用时,更多的在于数组的设计,在实际使用中,一般对于多维数组的统计相对来说比一维数组要少一些,更多的设计数组的大小,并规定数组中存储值的含义,在代码中按照值的规定使用数组。 //17ggs.com

    所以在实际使用多维数组以前,需要考虑清楚: //17ggs.com

    需要几维数组 //17ggs.com

    每一维的长度是多少

//17ggs.com

 

    按照怎样的规则存储值

//17ggs.com

 

    数组值的意义是什么 //17ggs.com

    拉丁方阵

//17ggs.com

 

    要求:实现任意阶拉丁矩阵的存储和输出拉丁矩阵是一种规则的数值序列,例如4阶的拉丁矩阵如下所示:

//17ggs.com

 

1         2 3 4
2         3 4 1
3         4 1 2
4         1 2 3

    该矩阵中的数字很规则,在实际解决该问题时,只需要把数值的规律描述出来即可。 //17ggs.com

    实现思路:声明一个变量n,代表矩阵的阶,声明和初始化一个nXn的数组,根据数据的规律,则对应的数值为(行号 + 列号 + 1),当数值比n大时,取和n的余数。

//17ggs.com

 

    实现的代码如下: //17ggs.com

                  int n = 6;
                   int[][] arr = new int[n][n];
                   int data; //数值
                   //循环赋值
                   for(int row = 0;row < arr.length;row++){
                            for(int col = 0;col < arr[row].length;col++){
                                     data = row + col + 1;
                                     if(data <= n){
                                               arr[row][col] = data;
                                     }else{
                                               arr[row][col] = data % n;
                                     }
                            }
                   }
                   //输出数组的值
                   for(int row = 0;row < arr.length;row++){
                            for(int col = 0;col < arr[row].length;col++){
                                     System.out.print(arr[row][col]);
                                     System.out.print(' ');
                            }
                            System.out.println();
                   }

    该代码中变量data存储行号+列号+1的值,每次在赋值时判别data的值是否小于等于n,根据判断的结果赋值对应数组元素的值。

//17ggs.com

 

    在解决实际问题时,观察数字规律,并且把该规律使用程序进行表达,也是每个程序员需要的基本技能。 //17ggs.com

    杨辉三角

//17ggs.com

 

    要求:实现10行杨辉三角元素的存储以及输出。 //17ggs.com

    杨辉三角是数学上的一个数字序列,该数字序列如下:

//17ggs.com

 

                     1

//17ggs.com

 

1         1
1          2 1
1          3 3 1
1          4 6 4 1

    该数字序列的规律为,数组中第一列的数字值都是1,后续每个元素的值等于该行上一行对应元素和上一行对应前一个元素的值之和。例如第五行第二列的数字4的值,等于上一行对应元素3和3前面元素1的和。 //17ggs.com

    实现思路:杨辉三角第几行有几个数字,使用行号控制循环次数,内部的数值第一行赋值为1,其它的数值依据规则计算。假设需要计算的数组元素下标为(row,col),则上一个元素的下标为(row – 1,col),前一个元素的下标是(row – 1,col – 1)。

//17ggs.com

 

    实现代码如下:

//17ggs.com

 

                  int[][] arr = new int[10][10];
                   //循环赋值
                   for(int row = 0;row < arr.length;row++){
                            for(int col = 0;col <= row;col++){
                                     if(col == 0){ //第一列
                                               arr[row][col] = 1;
                                     }else{
                                               arr[row][col] = arr[row - 1][col] + arr[row - 1][col - 1];
                                     }
                            }
                   }
                   //输出数组的值
                   for(int row = 0;row < arr.length;row++){
                            for(int col = 0;col <= row;col++){
                                     System.out.print(arr[row][col]);
                                     System.out.print(' ');
                            }
                            System.out.println();
                   }

    该题目中数字之间的规律比较简单,主要是理解数组的下标基本的处理,加深对于数组下标的认识,控制好数组元素的值。 //17ggs.com

存储图形结构 //17ggs.com

    要求:根据数组中的值,在对应位置绘制指定的字符。规定0绘制空格,1绘制星号(*)。数组的值如下所示:

//17ggs.com

 

                            {
                                     {0,0,0,1,0,0,0},
                                     {0,0,1,0,1,0,0},
                                     {0,1,0,0,0,1,0},
                                     {1,0,0,0,0,0,1},
                                     {0,1,0,0,0,1,0},
                                     {0,0,1,0,1,0,0},
                                     {0,0,0,1,0,0,0}
                            }

    该题目是一个基本的数组应用,数组中的值存储的是控制信息,程序根据数组中的值实现规定的功能。 //17ggs.com

    实现思路:循环数组中的元素,判断数组中的值,根据值绘制对应的字符即可。

//17ggs.com

 

    实现的代码如下所示: //17ggs.com

                  int[][] map = {

//17ggs.com

 

                                     {0,0,0,1,0,0,0},
                                     {0,0,1,0,1,0,0},
                                     {0,1,0,0,0,1,0},
                                     {1,0,0,0,0,0,1},
                                     {0,1,0,0,0,1,0},
                                     {0,0,1,0,1,0,0},
                                     {0,0,0,1,0,0,0}
                   };
                   //输出数组的值
                   for(int row = 0;row < map.length;row++){
                            for(int col = 0;col < map[row].length;col++){
                                     switch(map[row][col]){
                                     case 0:
                                               System.out.print(' ');
                                               break;
                                     case 1:
                                               System.out.print('*');
                                               break;
                                     }
                            }
                            System.out.println();
                   }

    类似的代码在游戏开发中,可以用来代表游戏中的地图数据,或者俄罗斯方块等益智游戏中地图块的值。 //17ggs.com

    螺旋数组

//17ggs.com

 

    要求:存储和输出nXm的螺旋数组,其中n和m为大于0的整数。 //17ggs.com

    以下是一些螺旋数组的示例:

//17ggs.com

 

1         2   3   4                     1   2   3   4   5
12 13 14 5                      14 15 16 17 6
11 16 15 6                      13 20 19 18 7
10 9   8   7                      12 11 10    9 8
4X4螺旋数组                         4X5螺旋数组

    对于螺旋数组来说,其中的数值很有规则,就是按照旋转的结构数值每次加1,实现该功能需要对数组和流程控制有角深刻的认识。 //17ggs.com

    实现思路:声明一个变量来代表需要为数组元素赋的值,对于其中的数字来说,每个数字都有一个移动方向,这个方向指向下一个元素,根据该方向改变数组的下标,如果到达边界或指向的元素已经赋值,则改变方向。

//17ggs.com

 

    实现代码如下: //17ggs.com

                  int n = 4;
                   int m = 5;
                   int[][] data = new int[n][m];
                   int dire;   //当前数字的移动方向
                   final int UP = 0;   //上
                   final int DOWN = 1; //下
                   final int LEFT = 2; //左
                   final int RIGHT = 3;//右
                   dire = RIGHT;
                   int value = 1;    //数组元素的值
                   int row = 0;     //第一维下标
                   int col = 0;     //第二维下标
                   data[0][0] = 1; //初始化第一个元素
                   while(value < n * m){
                            switch(dire){
                                     case UP:
                                               row--; //移动到上一行
                                               if(row < 0){ //超过边界
                                                        row++; //后退
                                                        dire = RIGHT;
                                                        continue; //跳过该次循环
                                               }else if(data[row][col] != 0){//已赋值
                                                        row++; //后退
                                                        dire = RIGHT;
                                                        continue; //跳过该次循环
                                               }
                                               break;
                                     case DOWN:
                                               row++; //移动到下一行
                                               if(row >= n){ //超过边界
                                                        row--; //后退
                                                        dire = LEFT;
                                                        continue; //跳过该次循环
                                               }else if(data[row][col] != 0){//已赋值
                                                        row--; //后退
                                                        dire = LEFT;
                                                        continue; //跳过该次循环
                                               }
                                               break;
                                     case LEFT:
                                               col--; //移动到前一列
                                               if(col < 0){ //超过边界
                                                        col++; //后退
                                                        dire = UP;
                                                        continue; //跳过该次循环
                                               }else if(data[row][col] != 0){//已赋值
                                                        col++; //后退
                                                        dire = UP;
                                                        continue; //跳过该次循环
                                               }
                                               break;
                                     case RIGHT:
                                               col++; //移动到后一行
                                               if(col >= m){ //超过边界
                                                        col--; //后退
                                                        dire = DOWN;
                                                        continue; //跳过该次循环
                                               }else if(data[row][col] != 0){//已赋值
                                                        col--; //后退
                                                        dire = DOWN;
                                                        continue; //跳过该次循环
                                               }
                                               break;
                            }
                            value++; //数值增加1
                            data[row][col] = value;//赋值                    
                   }
                   //输出数组中的元素
                   for(int i = 0;i < data.length;i++){
                            for(int j = 0;j < data[i].length;j++){
                                     if(data[i][j] < 10){//右对齐
                                               System.out.print(' ');
                                     }
                                     System.out.print(data[i][j]);
                                     System.out.print(' ');
                            }
                            System.out.println();
                   }

    在该代码中dire代表当前元素的移动方向,每个根据该变量的值实现移动,如果移动时超出边界或移动到的位置已赋值,则改变方向,并跳过本次循环,如果移动成功,则数值增加1,对数组元素进行赋值。

//17ggs.com

 

    对于多维数组来说,更多的是设计数组的结构,并根据逻辑的需要变换数组的下标,实现对于多维数组元素的操作。

//17ggs.com

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值