zoukankan      html  css  js  c++  java
  • day16(Scanner)

    Scanner

    package com.Scanner;
    
    import java.util.Scanner;
    
    public class Demo04 {
        public static void main(String[] args) {
            Scanner scanner = new Scanner(System.in);
    
            //从键盘接收数据
            int i = 0;
            float f = 0.0f;
    
            System.out.println("请输入整数:");
    
            //如果....那么
            if(scanner.hasNextInt()){
                i = scanner.nextInt();
                System.out.println("整数数据:"+i);
            }else{
                System.out.println("输入的不是整数数据!");
            }
    
    
            System.out.println("请输入小数:");
    
            //如果....那么
            if(scanner.hasNextFloat()){//要改
                f = scanner.nextFloat();//要改
                System.out.println("小数数据:"+f);
            }else{
                System.out.println("输入的不是小数数据!");
            }
    
            scanner.close();
        }
    }
    
    package com.Scanner;
    
    import java.util.Scanner;
    
    public class Demo05 {
        public static void main(String[] args) {
            //我们可以输入多个数字,并求其总和与平均数,每一个数字用回车确认,通过输入非数字来结束输出并输出执行结果
            Scanner scanner = new Scanner(System.in);
    
            //求和
            double sum = 0;
            //计算输入了多少个数字
             int m = 0;
            System.out.println("请输入数据");
             //通过循环判断是否还有输入,并在里面对每一次进行求和统计
            while (scanner.hasNextDouble()){
                double x = scanner.nextDouble();
                m = m + 1;//m++
                sum = sum + x;
                System.out.println("你输入了第"+m+"个数据,然后当前的结果sum="+sum);
            }
            System.out.println(m + "个数的和为" + sum);
            System.out.println(m + "个数的平均值是" + (sum / m));
    
            scanner.close();
        }
    }
    
  • 相关阅读:
    155. 最小栈
    160. 相交链表
    PAT 1057 Stack
    PAT 1026 Table Tennis
    PAT 1017 Queueing at Bank
    PAT 1014 Waiting in Line
    PAT 1029 Median
    PAT 1016 Phone Bills
    PAT 1010 Radix
    PAT 1122 Hamiltonian Cycle
  • 原文地址:https://www.cnblogs.com/Caesar-spike/p/14535911.html
Copyright © 2011-2022 走看看