栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > Java

java学习p137

Java 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

java学习p137

import java.util.Scanner;
public class a1 {
    public static void main(String[] args) {
        Scanner myScanner = new Scanner(System.in);
        System.out.print("请输入层数:");
        int totalLevel = myScanner.nextInt();
        for (int i = 1;i <= totalLevel;i++) {
            for (int k = 1;k <= totalLevel-i;k++) {
                System.out.print(" ");
            }
            for (int j = 1; j <= 2*i-1; j++) {
                System.out.print("*");
            }
            System.out.println("");
        }
    }
}

import java.util.Scanner;
public class a1 {
    public static void main(String[] args) {
        Scanner myScanner = new Scanner(System.in);
        System.out.print("请输入层数:");
        int totalLevel = myScanner.nextInt();
        for (int i = 1;i <= totalLevel;i++) {
            for (int k = 1;k <= totalLevel-i;k++) {
                System.out.print(" ");
            }
            for (int j = 1; j <= 2 * i - 1; j++) {
                if (j == 1 || j == 2 * i - 1 || i == totalLevel) {
                    System.out.print("*");
                }
                else {
                    System.out.print(" ");
                }
            }
            System.out.println("");
        }
    }
}

import java.util.Scanner;
public class a1 {
    public static void main(String[] args) {
        Scanner myScanner = new Scanner(System.in);
        System.out.print("请输入层数:");
        int totalLevel = myScanner.nextInt();
        for (int i = 1;i <= totalLevel;i++) {
            for (int k = 1;k <= totalLevel-i;k++) {
                System.out.print(" ");
            }
            for (int j = 1; j <= 2 * i - 1; j++) {
                if (j == 1 || j == 2 * i - 1) {
                    System.out.print("*");
                }
                else {
                    System.out.print(" ");
                }
            }
            System.out.println("");
        }
        int t = totalLevel - 1;
        for (int l = 1;l <= totalLevel - 1;l++) {
            for (int m = 1;m <= l;m++) {
                System.out.print(" ");
            }
            for (int n = 1; n <= 2 * t - 1; n++) {
                if (n == 1 || n == 2 * t - 1) {
                    System.out.print("*");
                }
                else {
                    System.out.print(" ");
                }
            }
            t--;
            System.out.println("");
        }
    }
}

菱形

转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/340988.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号