算法思维拓展：用java实现蛇形打印

谁践踏了优雅 2023-02-21 12:49 12阅读 0赞

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2N1aV95b25naHVh_size_16_color_FFFFFF_t_70]

class demo { 
        static int length = 8;
        static int value = 1;
        static int[][] snake = new int[length][length];
        static Direction lastDirection = Direction.Right;
    
        static enum Direction { 
            Right, Down, Left, Up;
        }
    
        public static void initialArray() { 
            int row = 0, col = 0;
            for (int c = 0; c < length * length; c++) { 
                snake[row][col] = value;
                lastDirection = findDirection(row, col);
                switch (lastDirection) { 
                    case Right:
                        col++;
                        break;
                    case Down:
                        row++;
                        break;
                    case Left:
                        col--;
                        break;
                    case Up:
                        row--;
                        break;
                    default:
                        System.out.println("error");
                }
                value++;
            }
        }
    
        static Direction findDirection(int row, int col) { 
            Direction direction = lastDirection;
            switch (direction) { 
                case Right: { 
                    if ((col == length - 1) || (snake[row][col + 1] != 0))
                        direction = direction.Down;
                    break;
                }
                case Down: { 
                    if ((row == length - 1) || (snake[row + 1][col] != 0))
                        direction = direction.Left;
                    break;
                }
                case Left: { 
                    if ((col == 0) || (snake[row][col - 1] != 0))
                        direction = direction.Up;
                    break;
                }
                case Up: { 
                    if (snake[row - 1][col] != 0)
                        direction = direction.Right;
                    break;
                }
            }
            return direction;
        }
    
        public static void main(String[] args) { 
            initialArray();
    
            // display.....
            for (int i = 0; i < length; i++) { 
                for (int j = 0; j < length; j++) { 
    // System.out.print(snake[i][j] + " ");
                    System.out.printf(" %2d", snake[i][j]);
                }
                System.out.println();
            }
        }
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2N1aV95b25naHVh_size_16_color_FFFFFF_t_70]: https://img-blog.csdnimg.cn/20200630204739901.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L2N1aV95b25naHVh,size_16,color_FFFFFF,t_70