zoukankan      html  css  js  c++  java
  • Java_2上课练习

    1. 打印出所有的"水仙花数",所谓"水仙花数"是指一个三位数,其各位数字立方和等于该数本身。例如:153是一个"水仙花数",因为153=1的三次方+5的三次方+3的三次方。(知识点:循环语句、条件语句)
    
    package demo3;
    
    import java.util.Scanner;
    import java.util.concurrent.SynchronousQueue;
    public class day01 {
    
        public static void main(String[] args) {
               int n,ge,shi,bai;
               for(n=100;n<=999;n++)
                 {
                   ge=n%100%10;
                   shi=n%100/10;
                   bai=n/100;
                   if(ge*ge*ge+bai*bai*bai+shi*shi*shi==n)
                   {
                       System.out.println(n);
                   }
                 }
               
              
          }
        
     }

    2.在控制台输出以下图形(知识点:循环语句、条件语句)正三角,倒三角
    package demo3;
    
    import java.util.Scanner;
    import java.util.concurrent.SynchronousQueue;
    public class day01 {
    
        public static void main(String[] args) {
               int n,i;
               for(n=1;n<=6;n++)
                 {
                           for (i = 1; i <=n ; i++) {
                               System.out.print(i);
                        }
                       System.out.println();
                  }
            }
               
              
          }

    package demo3;
    
    import java.util.Scanner;
    import java.util.concurrent.SynchronousQueue;
    public class day01 {
    
        public static void main(String[] args) {
               int n,i;
               for(n=1;n<=6;n++)
                 {
                           for (i = 1; i <=7-n ; i++) {
                               System.out.print(i);
                        }
                       System.out.println();
                  }
            }
               
              
          }
    
    
    
    
    package demo3;
    
    import java.util.Scanner;
    import java.util.concurrent.SynchronousQueue;
    public class day01 {
    
        public static void main(String[] args) {
               int n,i,x;
               for(n=1;n<=6;n++)
                 {
                           for (x = n; x <=5 ; x++) {
                               System.out.print(" ");
                           }
                                   for (i = n; i>0 ; i--) {
                                           System.out.print(i);
                                           }
                                   System.out.println();
                        }
                       System.out.println();
                  }
            }
               
        

    package demo3;
    
    import java.util.Scanner;
    import java.util.concurrent.SynchronousQueue;
    public class day01 {
    
        public static void main(String[] args) {
               int n,i,x;
               for(n=1;n<=6;n++)
                 {
                           for (x = 1; x <=n ; x++) {
                               System.out.print(" ");
                           }
                                   for (i = 1; i<=7-n; i++) {
                                           System.out.print(i);
                                           }
                                   System.out.println();
                        }
                       System.out.println();
                  }
            }

  • 相关阅读:
    LC 774. Minimize Max Distance to Gas Station 【lock,hard】
    LC 272. Closest Binary Search Tree Value II 【lock,hard】
    LC 644. Maximum Average Subarray II 【lock,hard】
    Java --- JSP2新特性
    Java ---Listener监听器
    Java ---Filter过滤器
    Java ---自定义标签(二)
    Java ---自定义标签
    Java ---理解MVC架构
    Java--JDBC连接数据库(二)
  • 原文地址:https://www.cnblogs.com/108-com/p/12619160.html
Copyright © 2011-2022 走看看