7110 digital trend 2 solution

Link Click to see the original question

Digital trend 2

2021.8.15 Regular practice of two-dimensional array 3 B topic

This problem is a very simple two-dimensional array problem , It is also a simulation problem ：

First step ： Definition and input

Define length and array $a$.

int a[MAXN][MAXN], n;

Enter $n$ Value .

This is too $lou$ 了 , If you don't want to learn again

---

The second step ： simulation

Define the variables needed for the simulation

We define a counting variable $step$, Count the steps taken .( That is, several numbers )

Then define its coordinates $x、y$.

int step, x = 0, y = 1;// Because the first step is to go down , therefore x Self acting 0

simulation

\	The first 1 Column	The first 2 Column	The first 3 Column	The first 4 Column	The first 5 Column
The first 1 That's ok	$a_{1,1}$	$a_{1,2}$	$a_{1,3}$	$a_{1,4}$	$a_{1,5}$
The first 2 That's ok	$a_{2,1}$	$a_{2,2}$	$a_{2,3}$	$a_{2,4}$	$a_{2,5}$
The first 3 That's ok	$a_{3,1}$	$a_{3,2}$	$a_{3,3}$	$a_{3,4}$	$a_{3,5}$
The first 4 That's ok	$a_{4,1}$	$a_{4,2}$	$a_{4,3}$	$a_{4,4}$	$a_{4,5}$
The first 5 That's ok	$a_{5,1}$	$a_{5,2}$	$a_{5,3}$	$a_{5,4}$	$a_{5,5}$

Go down

The condition to judge when going down is ：

1. Not out of array ;

2. There are no numbers in the lower grid .

The code is as follows ：

while (x + 1 <= n && a[x + 1][y] == 0) {
    
	a[++ x][y] = ++ step;
}

turn right

The condition to judge when walking to the right is ：

1. Not out of array ;

2. There are no numbers in the grid on the right .

The code is as follows ：

while (y + 1 <= n && a[x][y + 1] == 0) {
    
	a[x][++ y] = ++ step;
}

Go up

The condition to judge is ：

1. Not out of array ;

2. There are no numbers in the upper grid .

The code is as follows ：

while (x - 1 >= 1 && a[x - 1][y] == 0) {
    
	a[-- x][y] = ++ step;
}

turn left

The condition to judge when walking left is ：

1. Not out of array ;

2. There are no numbers in the grid on the left .

The code is as follows ：

while (y - 1 >= 1 && a[x][y - 1] == 0) {
    
	a[x][-- y] = ++ step;
}

---

The third step ： Output

With two $for$ Loop nested output .

Be careful ： It should be output like this

Place holder ：%4d

printf ("%4d", a[i][j]);

---

And finally

Want full code ？ No way

And finally ： Plagiarism is useless

cqbzgm Announcement of

Thank you for watching.