回形数矩阵-JAVA语言实现

package com.jyy.task;

import java.util.Scanner;

public class arrayAlgorithm {
	public static void main(String[] args) {
		
		int count = 1, lunci = 0;
		System.out.print("Please input layer:");
		Scanner scan = new Scanner(System.in);
		int layel = scan.nextInt();

		// 定义一个二维数组
		int[][] huiArray = new int[layel][layel]; // 定义的这个二维数组是m*m就是layelxlayel
		int flag = layel / 2 + 1;
		
		while (flag > 0) {
			for (int i = lunci; i < huiArray.length - lunci; i++) { // 回的第一行
				huiArray[lunci][i] = count;
				count++;
			}

			for (int i = lunci + 1; i < huiArray.length - lunci - 1; i++) { // 回的最后一列
				huiArray[i][huiArray.length - 1 - lunci] = count;
				count++;
			}

			for (int i = huiArray.length - 1 - lunci; i >= lunci; i--) { // 回的最后一行 //如果是奇数层这里会导致多+1
				huiArray[huiArray.length - 1 - lunci][i] = count;
				count++;
			}

			for (int i = huiArray.length - lunci - 2; i > lunci; i--) { // 回第一列
				huiArray[i][lunci] = count;
				count++;
			}

			lunci++;
			flag--;
		}

		if (layel % 2 == 1) {//如果layel是奇数那么中间是多+了一次1的
			huiArray[layel / 2][layel / 2] = huiArray[layel / 2][layel / 2] - 1;
		}

		// 打回形矩阵
		for (int i = 0; i < huiArray.length; i++) {
			for (int j = 0; j < huiArray[i].length; j++) {
				System.out.print(huiArray[i][j] + "    ");
			}
			System.out.println();
		}
	}
}

主要思路就是把这个回分为多个回来处理。