题目: 输入一个矩阵,按照从外向里以顺时针的顺序依次打印出每一个数字,例如,如果输入如下矩阵,则依次打印出数字1,2,3,4,8,12,16,15,14,13,9,5,6,7,11,10. 分析:我们可以把打印圈分为四步:第一步从左往右打印一行,第二步从上到下打印一列,第三步从右到左打印一行,第四部从下到上打印一列。第二步的前提是终止列号大于起始列号,第三步的前提是终止行号大于起始行号且终止列号大于起始列号,第四步前提是终止行号大于起始行号且终止列号大于起始列号。循环条件是start*2<columns&&start*2<rows。 代码如下: public class PrintMatrix { public static void main(String[] args) { int[][] array = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}, {13, 14, 15, 16}}; ArrayList<Integer> list = new ArrayList<>(); for (int i = 0; i < list.size(); i++) { System.out.println(list.get(i)); } int start = 0; while (array[0].length > start * 2 && array.length > start * 2) { print(array, list, start); ++start; } System.out.println(list.toString()); } public static void print(int[][] array, ArrayList<Integer> list, int start) { int endX = array[0].length - start - 1; int endY = array.length - start - 1; //从左往右第一行 for (int i = start; i <= endX; i++) { int number = array[start][i]; list.add(number); } //从上往下一列 if (start < endY) { for (int i = start + 1; i <= endY; i++) { int number = array[i][endX]; list.add(number); } } //从右往左一行 if (start < endX && start < endY) { for (int i = endX - 1; i >= start; i--) { int number = array[endY][i]; list.add(number); } } //从下往上一列 if (start < endX && start < endY) { for (int i = endY - 1; i >= start + 1; i--) { int number = array[i][start]; list.add(number); } } } }
算法之顺时针打印矩阵
最新推荐文章于 2024-07-12 17:06:20 发布