java實(shí)現(xiàn)的順時(shí)針/逆時(shí)針打印矩陣操作。分享給大家供大家參考，具體如下：

public class SnakeMatrix {

/**

* 定義矩陣的階數(shù)

*/

private int n;

//填充矩陣的值

private int k = 1;

private int[][] data;

/**

* 定義矩陣移動(dòng)的方向

*/

public enum Direction {

left, right, up, down,

}

SnakeMatrix(int n) {

this.n = n;

data = new int[n][n];

}

public void clockwisePrintMatrix() {

//定義行數(shù)

int rowLen = data.length;

//定義列數(shù)

int columnLen = data.length;

//移動(dòng)方向

Direction direction = Direction.right;

//定義上邊界

int upBound = 0;

//定義下邊界

int downBound = rowLen - 1;

//定義左邊界

int leftBound = 0;

//定義右邊界

int rightBound = columnLen - 1;

//矩陣當(dāng)前行數(shù)

int row = 0;

//矩陣當(dāng)前列數(shù)

int column = 0;

while (true) {

data[row][column] = k++;

if (upBound == downBound && leftBound == rightBound) {

// System.out.println(" upBound :"+upBound +" downBound :"+downBound+" leftBound :"+leftBound +" rightBound :"+rightBound);

break;

}

switch (direction) {

case right:

if (column < rightBound) {

++column;

} else {

++row;

direction = Direction.down;

++upBound;

}

break;

case down:

if (row < downBound) {

++row;

} else {

--column;

direction = Direction.left;

--rightBound;

}

break;

case up:

if (row > upBound) {

--row;

} else {

++column;

direction = Direction.right;

++leftBound;

}

break;

case left:

if (column > leftBound) {

--column;

} else {

--row;

direction = Direction.up;

--downBound;

}

break;

default:

break;

}

}

for (int i = 0; i < n; i++) {

for (int j = 0; j < n; j++) {

System.out.printf("%2d%s", data[i][j], " ");

}

System.out.println();

}

}

public void anticlockwisePrintMatrix() {

int rowLen = data.length;

int columnLen = data.length;

int leftBound = 0;

int rightBound = columnLen - 1;

int upBound = 0;

int downBound = rowLen - 1;

int row = 0;

int column = 0;

Direction direction = Direction.down;

while (true) {

data[row][column] = k++;

if (rightBound == leftBound && upBound == downBound) {

break;

}

switch (direction) {

case down:

if (row < downBound) {

row++;

} else {

column++;

direction = Direction.right;

leftBound++;

}

break;

case right:

if (column < rightBound) {

column++;

} else {

row--;

direction = Direction.up;

downBound--;

}

break;

case up:

if (row > upBound) {

row--;

} else {

direction = Direction.left;

column--;

rightBound--;

}

break;

case left:

if (column > leftBound) {

column--;

} else {

direction = Direction.down;

row++;

upBound++;

}

break;

default:

break;

}

}

for (int i = 0; i < n; i++) {

for (int j = 0; j < n; j++) {

System.out.printf("%2d%s", data[i][j], " ");

}

System.out.println();

}

}

}

首先呢上面是定義一個(gè)工具類，

public class MainActivity extends AppCompatActivity {

@Override

protected void onCreate(Bundle savedInstanceState) {

super.onCreate(savedInstanceState);

setContentView(R.layout.activity_main);

int number = 5;

SnakeMatrix snakeMatrix = new SnakeMatrix(number);

snakeMatrix.anticlockwisePrintMatrix();

//snakeMatrix.clockwisePrintMatrix();

}

}

直接進(jìn)行使用，有兩個(gè)方法，一個(gè)正序一個(gè)倒序

希望本文所述對(duì)大家java程序設(shè)計(jì)有所幫助。

總結(jié)

以上是生活随笔為你收集整理的java 矩阵求逆_java实现的顺时针/逆时针打印矩阵操作示例的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。