当前位置: 代码迷 >> 综合 >> 算法题解:创建一个由O和X构建的二维矩阵符合既定的要求(JAVA代码)
  详细解决方案

算法题解:创建一个由O和X构建的二维矩阵符合既定的要求(JAVA代码)

热度:52   发布时间:2024-01-15 19:16:11.0

算法题解:创建一个由O和X构建的二维矩阵符合既定的要求(JAVA代码)

编写代码创建一个M行N列(MXN)的二维矩阵,矩阵中的每个元素由O和X组成。

要求:O和X必须交替出现,矩阵的四边必须是X。

例如:
当:m = 3, n = 3
矩阵如下: 
X X X
X 0 X
X X X

当:m = 4, n = 5
矩阵如下:
X X X X X
X 0 0 0 X
X 0 0 0 X
X X X X X

当:m = 5, n = 5
矩阵如下:
X X X X X
X 0 0 0 X
X 0 X 0 X
X 0 0 0 X
X X X X X

当:m = 6, n = 7
矩阵如下:
X X X X X X X
X 0 0 0 0 0 X
X 0 X X X 0 X
X 0 X X X 0 X
X 0 0 0 0 0 X
X X X X X X X 


算法设计

package com.bean.algorithm.basic;public class CreateMatrixWithOX {static void fill0X(int m, int n) {/** k - starting row index * m - ending row index * l - starting column index * n - ending column index * i - iterator*/int i, k = 0, l = 0;// r代表row,c代表colint r = m, c = n;// 创建二维字符数组a,用于输出结果char a[][] = new char[m][n];char x = 'X';// Fill characters in a[][] in spiral// form. Every iteration fills// one rectangle of either Xs or Oswhile (k < m && l < n) {/* Fill the first row from the remaining rows */for (i = l; i < n; ++i)a[k][i] = x;k++;/* Fill the last column from the remaining columns */for (i = k; i < m; ++i)a[i][n - 1] = x;n--;/* Fill the last row from the remaining rows */if (k < m) {for (i = n - 1; i >= l; --i)a[m - 1][i] = x;m--;}/** Print the first column // from the remaining columns*/if (l < n) {for (i = m - 1; i >= k; --i)a[i][l] = x;l++;}// Flip character for next iterationx = (x == '0') ? 'X' : '0';}// 输出二维数组for (i = 0; i < r; i++) {for (int j = 0; j < c; j++) {System.out.print(a[i][j] + " ");}System.out.println();}}public static void main(String[] args) {System.out.println("Output for m = 5, n = 6");fill0X(5, 6);System.out.println("Output for m = 4, n = 4");fill0X(4, 4);System.out.println("Output for m = 3, n = 4");fill0X(3, 4);}
}

程序运行结果:

Output for m = 5, n = 6
X X X X X X 
X 0 0 0 0 X 
X 0 X X 0 X 
X 0 0 0 0 X 
X X X X X X 
Output for m = 4, n = 4
X X X X 
X 0 0 X 
X 0 0 X 
X X X X 
Output for m = 3, n = 4
X X X X 
X 0 0 X 
X X X X