这是个入门题,但是很有意思,因为这种上下左右访问的问题,以后还会用的上
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception{
int[] direct=new int[]{1,2,3,4};// 1右(j+1) 2下(i+1) 3左(j-1) 4上(i-1)
BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st=new StringTokenizer(reader.readLine());
int N=Integer.parseInt(st.nextToken());
int z=N+2;
int[][] arr=new int[z][z];
for (int i = 1; i <z-1 ; i++) {//把可以访问的区域,设置成-1
for (int j = 1; j <z-1 ; j++) {
arr[i][j]=-1;
}
}
int step=0;
int dire=0;
int i=1;
int j=0;
while(step<N*N){
arr[i][j]=step;