Almost Rectangle

最新推荐文章于 2022-01-15 20:56:59 发布

weixin_45817187

最新推荐文章于 2022-01-15 20:56:59 发布

阅读量112

点赞数

分类专栏：题目

本文链接：https://blog.csdn.net/weixin_45817187/article/details/116356785

版权

题目专栏收录该内容

35 篇文章 0 订阅

订阅专栏

Almost Rectangle

2021.05.01 训练题A
题目大意：有一个nxn的矩阵，矩阵中有两个标记 ’ * ’ ，添加另外两个标记使得其围成一个矩行
思路：
1.两个标记在同一行，则将另外两个标记分别放在这两个标记上方或下方
2.两个标记在同一列，则将另外两个标记分别放在这两个标记左方或右方
3.两个标记不在同一行或者同一列，若将两个已知标记的坐标获取到记为(x1,y1),(x2,y2),则另外两个标记的位置为(x1,y2),(x2,y1)

There is a square field of size n×n in which two cells are marked. These cells can be in the same row or column.

You are to mark two more cells so that they are the corners of a rectangle with sides parallel to the coordinate axes.

For example, if n=4 and a rectangular field looks like this (there are asterisks in the marked cells):

..∗.
....
∗...
....
Then you can mark two more cells as follows

∗.∗.
....
∗.∗.
....
If there are several possible solutions, then print any of them.

Input
The first line contains a single integer t (1≤t≤400). Then t test cases follow.

The first row of each test case contains a single integer n (2≤n≤400) — the number of rows and columns in the table.

The following n lines each contain n characters '.' or '*' denoting empty and marked cells, respectively.

It is guaranteed that the sums of n for all test cases do not exceed 400.

It is guaranteed that there are exactly two asterisks on the field. They can be in the same row/column.

It is guaranteed that the solution exists.

Output
For each test case, output n rows of n characters — a field with four asterisks marked corresponding to the statements. If there multiple correct answers, print any of them.

Example
Input
6
4
..*.
....
*...
....
2
*.
.*
2
.*
.*
3
*.*
...
...
5
.....
..*..
.....
.*...
.....
4
....
....
*...
*...
Output
*.*.
....
*.*.
....
**
**
**
**
*.*
*.*
...
.....
.**..
.....
.**..
.....
....
....
**..
**..

Java 详细代码（代码虽长，但思路简单）


import java.util.Scanner;

public class Almost_Rectangle {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		while(t-- != 0) {
			int n = sc.nextInt();
			sc.nextLine();
			char[][] ch = new char[n][n];
			for(int i=0;i<n;i++) {
				ch[i] = sc.nextLine().toCharArray();
			}
			int x1 = 0,y1 = 0,x2 = 0,y2 = 0;
			int key = 0;
			for(int i=0;i<n;i++) {
				if(key == 2) break;
				for(int j=0;j<n;j++) {
					if(key == 2)break;
					if(ch[i][j] == '*') {
						if(key == 0) {
							key = 1;
							x1 = i;
							y1 = j;
						}else {
							key = 2;
							x2 = i;
							y2 = j;
						}
					}
				}
			}
			if(x1 == x2) {
				ch[x1 > 0 ? x1-1 : x1+1][y1]='*';
				ch[x1 > 0 ? x1-1 : x1+1][y2]='*';
			}else if(y1 == y2) {
				ch[x1][y1 > 0 ? y1-1 : y1+1]='*';
				ch[x2][y1 > 0 ? y1-1 : y1+1]='*';
			}else {
				ch[x1][y2] = '*';
				ch[x2][y1] = '*';
			}
			for(int i=0;i<n;i++) {
				for(int j=0;j<n;j++) {
					System.out.print(ch[i][j]);
				}
				System.out.println();
			}
		}
	}
}