第4章练习题_have a nice year 2020-程序员宅基地

技术标签： Java string import testing go 游戏 class

// ES01.java: Simple method use

import tio.Console;

class ES01 {
    public static void main(String[] args) {
        System.out.println("Type your age:");
        int intAge = Console.in.readInt();
        System.out.println("Happy birthday to you!");
        printMessage(intAge); //method call
        System.out.println("Have a nice year!");
    }

    //definition of method printMessage
    static void printMessage(int intAge) {
        if (intAge == 1)
            System.out.println("You are " + intAge + " year old!");
        else
            System.out.println("You are " + intAge + " years old!");
    }
}

// ES02.java: Simple method use

import tio.Console;

class ES02 {
    public static void main(String[] args) {
        System.out.println("Type your age:");
        int intN = Console.in.readInt();
        System.out.println("Happy birthday to you!");
        printMessage(intN); //method call
        System.out.println("Have a nice year!");
    }

// ES03.java
class ES03 {
    public static void main(String[] args) {
        System.out.println("A TABLE OF POWERS");
        System.out.println("-----------------/n");
        System.out.println("Integer/tSquare/tCube/tQuartic/tQuintic");
        System.out.println("-------/t------/t----/t-------/t-------");
        for (int intI = 1; intI <= 25; intI++) {
            System.out.println(intI + "/t" + square(intI) + "/t"
                    + cube(intI) + "/t" + quartic(intI) + "/t"
                    + quintic(intI));
        }
    }

    static int square(int intNum) {
        return intNum * intNum;
    }

    static int cube(int intNum) {
        return intNum * intNum * intNum;
    }

    static int quartic(int intNum) {
        return square(intNum) * square(intNum);
    }

    static int quintic(int intNum) {
        return square(intNum) * cube(intNum);
    }
}

// ES04.java
class ES04 {
public static void main(String[] args) {
}

    static int max(int x, int y) {
        if (x > y)
            return x;
        else
            return y;
    }

    static double max(double x, double y) {
        if (x > y)
            return x;
        else
            return y;
    }
}

// ES05.java

import tio.*;

class RunSums {
    public static void main(String[] args) {
        System.out.println("Type a number:");
        int intCount = Console.in.readInt();
        printBanner();
        printHeadings();
        readAndPrintData(intCount);
    }

    // printBanner, printHeadings and readAndPrintData
    // definitions will go here
    static void printBanner() {
        System.out.println("/n"
                + "********************************************/n"
                + "*   RUNNING SUMS, MINIMUMS, AND MAXIMUMS   */n"
                + "********************************************/n");
    }

    static void printHeadings() {
        System.out.println("Count/tItem/tSum/tMinimum/tMaximum");
    }

    static void readAndPrintData(int intCount) {
        int cnt = 0, sum = 0, item, smallest, biggest;
        if (intCount > 0) {
            item = Console.in.readInt();
            cnt++;
            sum = sum + item;
            smallest = biggest = item;
            System.out.println(cnt + "/t" + item + "/t" + sum + "/t"
                    + smallest + "/t" + biggest);
            while (cnt != intCount) {
                item = Console.in.readInt();
                cnt++;
                sum = sum + item;
                smallest = min(item, smallest);
                biggest = max(item, biggest);
                System.out.println(cnt + "/t" + item + "/t" + sum
                        + "/t" + smallest + "/t" + biggest);
            }
        }
        System.out.println("Print Complete.");
    }

    static int min(int a, int b) {
        if (a < b)
            return a;
        else
            return b;
    }

    static int max(int a, int b) {
        if (a > b)
            return a;
        else
            return b;
    }
}

// ES06.java

import tio.*;

class ES06 {
    public static void main(String[] args) {
        printBanner();
        printHeadings();
        readAndPrintData();
    }

    static void printHeadings() {
        System.out.println("Count/tItem/tSum/tMinimum/tMaximum");
    }

    static void readAndPrintData() {
        int cnt = 0, sum = 0, item, smallest, biggest;
        item = Console.in.readInt();
        cnt++;
        sum = sum + item;
        smallest = biggest = item;
        System.out.println(cnt + "/t" + item + "/t" + sum + "/t"
                + smallest + "/t" + biggest);
        while (Console.in.hasMoreElements()) {
            item = Console.in.readInt();
            cnt++;
            sum = sum + item;
            smallest = min(item, smallest);
            biggest = max(item, biggest);
            System.out.println(cnt + "/t" + item + "/t" + sum + "/t"
                    + smallest + "/t" + biggest);
        }
    }

    static int min(int a, int b) {
        if (a < b)
            return a;
        else
            return b;
    }

    static int max(int a, int b) {
        if (a > b)
            return a;
        else
            return b;
    }
}

// ES07.java
class ES07 {
    public static void main(String[] args) {
        //Input the number of tosses in a row to try for.
        int numTosses = 5; //Just use 4 for testing
        //Input the number of trials to run.
        int numTrials = 10000; //Use 10000 for testing
        //Perform the specified number of trials
        int numSuccesses = performTrials(numTosses, numTrials);
        //Print the results
        double probability = numSuccesses / (double) numTrials;
        System.out.println("Probability found in " + numTrials
                + " is " + probability);
    }

    // perform numTrials simulated coin tosses
    // and return the number of successes
    static int performTrials(int numTosses, int numTrials) {
        System.out.println("Monte Carlo " + numTosses
                + " in a row heads");
        int numSuccesses = 0;
        for (int trials = 0; trials < numTrials; trials++)
            // perform one trial
            if (isAllHeads(numTosses))
                numSuccesses++; // trial was a success
        return numSuccesses;
    }

    // return true if numTosses heads are tossed
    // before a tail
    static boolean isAllHeads(int numTosses) {
        double outcome;
        for (int numHeads = 0; numHeads < numTosses; numHeads++) {
            outcome = Math.random(); // toss the coin
            if (outcome < 0.2)
                return false; // tossed a tail
        }
        return true; // tossed all heads
    }
}

// ES08.java
class ES08 {
    public static void main(String[] args) {
        //Input the number of tosses in a row to try for.
        int numTosses = 6; //Just use 6 for testing
        //Input the number of trials to run.
        int numTrials = 10000; //Use 10000 for testing
        //Perform the specified number of trials
        int numCount = 10;
        int numSuccesses = performTrials(numCount, numTosses,
                numTrials);
        //Print the results
        double probability = numSuccesses / (double) numTrials;
        System.out.println("Probability found in " + numTrials
                + " is " + probability);
    }

    // perform numTrials simulated coin tosses
    // and return the number of successes
    static int performTrials(int numCount, int numTosses,
            int numTrials) {
        System.out.println("Monte Carlo " + numTosses
                + " in a row heads");
        int numSuccesses = 0;
        for (int trials = 0; trials < numTrials; trials++)
            // perform one trial
            if (almostAllHeads(numCount, numTosses))
                numSuccesses++; // trial was a success
        return numSuccesses;
    }

    static boolean almostAllHeads(int n, int k) {
        int intCount = 0;
        double outcome;
        for (int intI = 1; intI <= n; intI++) {
            outcome = Math.random();
            if (outcome < 0.5)
                intCount++;
        }
        if (intCount >= k)
            return true;
        else
            return false;
    }
}

// ES09.java
class ES09 {
    public static void main(String[] args) {
        //Input the number of tosses in a row to try for.
        int numTosses = 5; //Just use 5 for testing
        //Input the number of trials to run.
        int numTrials = 1000000; //Use 10000 for testing
        //Perform the specified number of trials
        int numCount = 10;
        int numSuccesses = performTrials(numCount, numTosses,
                numTrials);
        //Print the results
        double probability = numSuccesses / (double) numTrials;
        System.out.println("Probability found in " + numTrials
                + " is " + probability);
    }

    static boolean almostAllHeads(int n, int k) {
        int intCount = 0;
        double outcome;
        for (int intI = 1; intI <= n; intI++) {
            outcome = Math.random();
            if (outcome < 0.5)
                intCount++;
        }
        if (intCount == k)
            return true;
        else
            return false;
    }
}

10.

// ES10.java

import tio.*;

class ES10 {
    public static void main(String[] args) {
        System.out.println("Type width, height and Text:");
        int intHeight, intWidth;
        String strText;
        intWidth = Console.in.readInt();
        intHeight = Console.in.readInt();
        strText = Console.in.readWord();
        drawBox(intWidth, intHeight, strText);
    }

    static void drawBox(int intWidth, int intHeight, String strText) {
        drawLine(intWidth, strText);
        drawSides(intHeight, intWidth, strText);
        drawLine(intWidth, strText);
    }

    static void drawLine(int intWidth, String strText) {
        for (int intI = 0; intI < intWidth; intI++) {
            System.out.print(strText + " ");
        }
        System.out.println();
    }

    static void drawSides(int intHeight, int intWidth, String strText) {
        intHeight = intHeight - 2;
        intWidth = intWidth - 2;
        intWidth = intWidth * ((strText).length() + 1);
        for (int intI = 0; intI < intHeight; intI++) {
            System.out.print(strText + " ");
            for (int intJ = 0; intJ < intWidth; intJ++) {
                System.out.print(" ");
            }
            System.out.println(strText + " ");
        }
    }
}

11.

// ES11.java
class ES11 {
    public static void main(String[] args) {
        int intDays = 10;
        weatherReport(intDays);
    }

    private static void weatherReport(int intDays) {
        double dblWeather;
        for (int intI = 0; intI < intDays; intI++) {
            dblWeather = Math.random() * 3;
            if (dblWeather > 2)
                System.out.println("Clody");
            else
                if (dblWeather > 1)
                    System.out.println("Sunny");
                else
                    System.out.println("Rainy");
        }
    }
}

12.

// ES12.java
class ES12 {
    public static void main(String[] args) {
        switch ((int) (10 * Math.random())) {
            case 0:
                break;
            case 1:
                break;
            case 2:
                break;
            case 3:
                break;
            case 4:
                break;
            case 5:
                break;
            case 6:
                break;
            case 7:
                break;
            case 8:
                break;
            case 9:
                break;
        }
    }
}

13.

// ES13.java
class ES13 {
    public static void main(String[] args) {
        double dblX1 = 0.0, dblX2 = 10.0, dblStep = 0.01;
        func(dblX1, dblX2, dblStep);
    }

    static void func(double dblX1, double dblX2, double dblStep) {
        double dblMin, dblMax, dblFunc;
        if (dblX1 < dblX2) {
            dblFunc = dblX1 * dblX1 - 2;
            System.out.println(dblFunc);
            dblMin = dblMax = dblFunc;
            dblX1 = dblX1 + dblStep;
            while (dblX1 < dblX2) {
                dblFunc = dblX1 * dblX1 - 2;
                System.out.println(dblFunc);
                dblMin = min(dblFunc, dblMin);
                dblMax = max(dblFunc, dblMax);
                dblX1 = dblX1 + dblStep;
            }
            System.out.println("The max number is: " + dblMax);
            System.out.println("The min number is: " + dblMin);
        }
    }

    static double min(double dblX, double dblY) {
        if (dblX < dblY)
            return dblX;
        else
            return dblY;
    }

    static double max(double dblX, double dblY) {
        if (dblX > dblY)
            return dblX;
        else
            return dblY;
    }
}

14.

// ES14.java
class ES14 {
    public static void main(String[] args) {
        double a = 0.0, b = 10.0, x, step = 0.001;
        double dblMin, dblX;
        x = a; /* start at one end */
        dblMin = f(x);
        dblX = x;
        while (f(x) != 0.0 && x < b) {
            dblMin = min(f(x), dblMin);
            if (dblMin == f(x))
                dblX = x;
            x = x + step;
        }
        if (x < b)
            System.out.println(" root is " + x);
        else
            System.out.println(" simple root is " + dblX);
    }

    static double f(double x) {
        return (x * x - 2.0);
    }

    static double min(double dblX, double dblY) {
        if (Math.abs(dblX) < Math.abs(dblY))
            return dblX;
        else
            return dblY;
    }
}

15.

// ES15.java
class ES15 {
    public static void main(String[] args) {
        double a = 0.0, b = 5.0, eps = 0.00001;
        double root = 0.0, residual;
        while (b - a > eps) {
            root = (a + b) / 2.0;
            residual = f(root);
            if (residual > 0)
                b = root;
            else
                a = root;
        }
        System.out.println(" root is " + root);
    }

    static double f(double x) {
        return (Math.pow(Math.E, Math.pow(x, 2)) - 10.0);
    }
}

16.

// ES16.java
class ES16 {
    public static void main(String[] args) {
        double a = 0.0, b = 5.0;
        double root = 0.0, result, times = 100;
        for (int intI = 0; intI < times; intI++) {
            result = Math.random() * (b - a) + a;
            if (Math.abs(f(result)) < Math.abs(f(root)))
                root = result;
        }
        System.out.println(" root is " + root);
    }

    static double f(double x) {
        return (Math.pow(Math.E, Math.pow(x, 2)) - 10.0);
    }
}

17.

// ES17.java

import tio.Console;

class ES17 {
    public static void main(String[] args) {
        //初始化游戏者钱数。
        int intMoney = 100;
        System.out.println("You have 100 dollars left.");
        //循环，如果需要退出，输入赌钱数0
        while (intMoney > 0) {
            //游戏者下注
            System.out.println("Put down some money,/n"
                    + "Put 0 for quit.");
            int intBet = Console.in.readInt();
            if (intBet > intMoney)
                continue;
            if (intBet == 0)
                break;
            //游戏者掷骰子
            int intDisc = disc();
            System.out.println("You throw out: " + intDisc);
            //判断结果
            intMoney = result(intMoney, intBet, intDisc);
        }
    }

    static int result(int intMoney, int intBet, int intDisc) {
        //判断swith
        switch (intDisc) {
            case 7:
            case 11:
                intMoney = playerWin(intMoney, intBet);
                break;
            case 2:
            case 12:
                intMoney = playerLose(intMoney, intBet);
                break;
            default:
                //赋值point
                int intPoint = intDisc;
                System.out.println("Your point is " + intPoint);
                //继续掷色子直至7或point
                intDisc = disc();
                System.out.println("Rethrow: " + intDisc);
                while (intDisc != 7 && intDisc != intPoint) {
                    intDisc = disc();
                    System.out.println("Rethrow: " + intDisc);
                }
                if (intDisc == 7)
                    intMoney = playerLose(intMoney, intBet);
                else
                    intMoney = playerWin(intMoney, intBet);
        }
        return intMoney;
    }

    static int disc() {
        int result = 0;
        result = result + (int) (Math.random() * 6) + 1;
        result = result + (int) (Math.random() * 6) + 1;
        return result;
    }

    static int playerWin(int intMoney, int intBet) {
        intMoney = intMoney + intBet;
        System.out.println("You win and earn some money/n"
                + "You have " + intMoney + " dollars left.");
        return intMoney;
    }

    static int playerLose(int intMoney, int intBet) {
        intMoney = intMoney - intBet;
        if (intMoney == 1 || intMoney == 0)
            System.out.println("You lose./n" + "You have " + intMoney
                    + " dollar left.");
        else
            System.out.println("You lose./n" + "You have " + intMoney
                    + " dollars left.");
        return intMoney;
    }
}

18.

// ES18.java
class ES18 {
    public static void main(String[] args) {
        char chrX1 = 'a', chrX2 = 'z';
        charPrint(chrX1, chrX2);
    }

    static void charPrint(char chrX1, char chrX2) {
        if (chrX1 < chrX2) {
            System.out.println(chrX1);
            charPrint((char) (chrX1 + 1), chrX2);
        }
        else
            System.out.println(chrX1);
    }
}

19.

// ES19.java
class ES19 {
    public static void main(String[] args) {
        char chrX1 = 'c', chrX2 = 'g';
        printRange(chrX1, chrX2);
    }

    static void printRange(char first, char last) {
        if (first < last) {
            System.out.println(first);
            printRange((char) (first + 1), last);
        }
        else
            System.out.println(first);
    }
}

20.

// ES20.java
class ES20 {
    public static void main(String[] args) {
        int n = 40;
        System.out.println(fibonacci(n));
    }

    static long fibonacci(int n) {
        int f0 = 0, f1 = 1, f2;
        f2 = f0 + f1;
        for (int i = 2; i <= n; i++) {
            f2 = f0 + f1;
            f0 = f1;
            f1 = f2;
        }
        return f2;
    }
}

本文链接：https://blog.csdn.net/fredonline/article/details/212448

原作者删帖不实内容删帖广告或垃圾文章投诉

智能推荐

c# 调用c++ lib静态库_c#调用lib-程序员宅基地

文章浏览阅读2w次，点赞7次，收藏51次。四个步骤1.创建C++ Win32项目动态库dll 2.在Win32项目动态库中添加外部依赖项 lib头文件和lib库3.导出C接口4.c#调用c++动态库开始你的表演...①创建一个空白的解决方案，在解决方案中添加 Visual C++ , Win32 项目空白解决方案的创建：添加Visual C++ , Win32 项目这......_c#调用lib

deepin/ubuntu安装苹方字体-程序员宅基地

文章浏览阅读4.6k次。苹方字体是苹果系统上的黑体，挺好看的。注重颜值的网站都会使用，例如知乎：font-family: -apple-system, BlinkMacSystemFont, Helvetica Neue, PingFang SC, Microsoft YaHei, Source Han Sans SC, Noto Sans CJK SC, W..._ubuntu pingfang

html表单常见操作汇总_html表单的处理程序有那些-程序员宅基地

文章浏览阅读159次。表单表单概述表单标签表单域按钮控件demo表单标签表单标签基本语法结构<form action="处理数据程序的url地址“ method=”get|post“ name="表单名称”></form><!--method将表单中的数据传送给服务器处理，get方式直接显示在url地址中，数据可以被缓存，且长度有限制；而post方式数据隐藏传输，_html表单的处理程序有那些

PHP设置谷歌验证器（Google Authenticator）实现操作二步验证_php otp 验证器-程序员宅基地

文章浏览阅读1.2k次。使用说明:开启Google的登陆二步验证（即Google Authenticator服务）后用户登陆时需要输入额外由手机客户端生成的一次性密码。实现Google Authenticator功能需要服务器端和客户端的支持。服务器端负责密钥的生成、验证一次性密码是否正确。客户端记录密钥后生成一次性密码。下载谷歌验证类库文件放到项目合适位置(我这边放在项目Vender下面)https://github.com/PHPGangsta/GoogleAuthenticatorPHP代码示例://引入谷_php otp 验证器

【Python】matplotlib.plot画图横坐标混乱及间隔处理_matplotlib更改横轴间距-程序员宅基地

文章浏览阅读4.3k次，点赞5次，收藏11次。matplotlib.plot画图横坐标混乱及间隔处理_matplotlib更改横轴间距

docker — 容器存储_docker 保存容器-程序员宅基地

文章浏览阅读2.2k次。①Storage driver 处理各镜像层及容器层的处理细节，实现了多层数据的堆叠，为用户提供了多层数据合并后的统一视图②所有 Storage driver 都使用可堆叠图像层和写时复制（CoW）策略③docker info 命令可查看当系统上的 storage driver主要用于测试目的，不建议用于生成环境。_docker 保存容器

随便推点

网络拓扑结构_网络拓扑csdn-程序员宅基地

文章浏览阅读834次，点赞27次，收藏13次。网络拓扑结构是指计算机网络中各组件（如计算机、服务器、打印机、路由器、交换机等设备）及其连接线路在物理布局或逻辑构型上的排列形式。这种布局不仅描述了设备间的实际物理连接方式，也决定了数据在网络中流动的路径和方式。不同的网络拓扑结构影响着网络的性能、可靠性、可扩展性及管理维护的难易程度。_网络拓扑csdn

JS重写Date函数，兼容IOS系统_date.prototype 将所有 ios-程序员宅基地

文章浏览阅读1.8k次，点赞5次，收藏8次。IOS系统Date的坑要创建一个指定时间的new Date对象时，通常的做法是：new Date("2020-09-21 11:11:00")这行代码在 PC 端和安卓端都是正常的，而在 iOS 端则会提示 Invalid Date 无效日期。在IOS年月日中间的横岗许换成斜杠，也就是new Date("2020/09/21 11:11:00")通常为了兼容IOS的这个坑，需要做一些额外的特殊处理，笔者在开发的时候经常会忘了兼容IOS系统。所以就想试着重写Date函数，一劳永逸，避免每次ne_date.prototype 将所有 ios