回形数java实现

package com.atguigu.arithetic;

import java.util.Scanner;
/**
 * 
 *@Description 回形数
 *@author DongHao-Atticus Emain 1061943962@qq.com
 *@version
 *@data 2020-9-1815:56:36
 *
 */
public class HuiXingNumber {
	/*
	 * 遍历数组
	 */
	public void Traverse(int[][] array) {
		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array[i].length; j++) {
				System.out.print(array[i][j] + "\t");
			}
			System.out.println();
		}
	}
	
	/*
	 * 回形数赋值
	 */
	public void assignValue(int[][] array) {
		int len = array.length;
		int s = len * len;//元素总数
		/*
		 * k = 1:向右 k = 2:向下 k = 3:向左 k = 4:向上
		 */
		int k = 1 ;//方向
		int i = 0,j = 0;//行列
		for (int m = 1; m <= s; m++) {
			if(k == 1) {
				if(j < len && array[i][j] == 0) {
					array[i][j++] = m;
				}else {
					k = 2;
					m--;
					j--;
					i++;
				}
			}else if(k == 2){
				if (i < len && array[i][j] == 0) {
					array[i++][j] = m;
				}else {
					k++;
					m--;
					i--;
					j--;
				}
			}else if (k == 3) {
				if (j >= 0 && array[i][j] == 0) {
					array[i][j--] = m;
				}else {
					k++;
					j++;
					i--;
					m--;
				}
			}else if(k == 4){
				if (i >= 0 && array[i][j] == 0 ) {
					array[i--][j] = m;
				}else {
					k = 1;
					i++;
					j++;
					m--;
				}
			}
		}
	}
	
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		System.out.println("输入回形数大小");
		int len = scanner.nextInt();
		int[][] arr = new int[len][len];
		HuiXingNumber huiXingNumber = new HuiXingNumber();
		huiXingNumber.assignValue(arr);
		huiXingNumber.Traverse(arr);
		
	}

}