DNA （Java代码）

解题思路:


自己自行理解 ;


注意事项:





参考代码:

package cn.hui.lanqiaobei02;

import java.util.Scanner;

public class Main1115

{

public static void main(String[] args)

{

Scanner input = new Scanner(System.in);

int n = input.nextInt(); // 两组数 ;

// input.nextLine();

while (n-->0)

{

input.nextLine();

int x1 = input.nextInt();

int x2 = input.nextInt();

char[][] arr = new char[x1][x1];

for (int i = 0; i < x1; i++)

{

for (int j = 0; j < x1; j++)

{

if (i == j)

{

arr[i][j] = 'X';

} else if (i + j == x1 - 1)

{

arr[i][j] = 'X';

} else

{

arr[i][j] = ' ';

}

}

}

for (int i = 0; i < x1; i++)

{

for (int j = 0; j < x1; j++)

{

System.out.print(arr[i][j]);

}

System.out.println();

}

for (int m = 0; m < x2 - 1; m++)

{

for (int i = 1; i < x1; i++)

{

for (int j = 0; j < x1; j++)

{

System.out.print(arr[i][j]);

}

System.out.println();

}

}

System.out.println();

}

}

}