java编程----数字金字塔(数学、模拟)

最新推荐文章于 2025-03-12 10:18:23 发布

lanxuepiaoling

最新推荐文章于 2025-03-12 10:18:23 发布

阅读量3k

点赞数 1

分类专栏： Java编程学习

本文链接：https://blog.youkuaiyun.com/lanxuepiaoling/article/details/44598083

版权

Java编程学习专栏收录该内容

6 篇文章

订阅专栏

方法一：

import java.util.Scanner;
public class Pyramid {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.print("Enter the number of lines: ");
        int lines = input.nextInt();

        int CurrentLine,Space,num_left,num_right;
        for(CurrentLine=1;CurrentLine<=lines;CurrentLine++){
            for(Space=1;Space<=lines-CurrentLine;Space++)
                System.out.print(" ");

            for(num_left=CurrentLine;num_left>=1;num_left--)
                System.out.print(num_left);

            for(num_right=2;num_right<=CurrentLine;num_right++)
                System.out.print(num_right);
            System.out.println();
        }

    }

}

运行结果：

方法二：

public class Pyramid {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        System.out.print("Enter the number of lines: ");
        int lines = input.nextInt();

        int CurrentLine,Space,num_left,num_right;
        for(CurrentLine=1;CurrentLine<=lines;CurrentLine++){
            for(Space=1;Space<=lines-CurrentLine;Space++)
                System.out.print( " "); 

            for(num_left=1;num_left<=Math.pow(2, CurrentLine-1);num_left*=2)
                System.out.print(num_left + " ");

            for(num_right=(int)(Math.pow(2, CurrentLine-2));num_right>=1;num_right/=2)
                System.out.print(num_right + " ");
                System.out.println();
        }

    }

}