null - 程序员宅基地

第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

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

智能推荐

oracle 12c 集群安装后的检查_12c查看crs状态-程序员宅基地

文章浏览阅读1.6k次。安装配置gi、安装数据库软件、dbca建库见下：http://blog.csdn.net/kadwf123/article/details/784299611、检查集群节点及状态：[root@rac2 ~]# olsnodes -srac1 Activerac2 Activerac3 Activerac4 Active[root@rac2 ~]_12c查看crs状态

解决jupyter notebook无法找到虚拟环境的问题_jupyter没有pytorch环境-程序员宅基地

文章浏览阅读1.3w次，点赞45次，收藏99次。我个人用的是anaconda3的一个python集成环境，自带jupyter notebook，但在我打开jupyter notebook界面后，却找不到对应的虚拟环境，原来是jupyter notebook只是通用于下载anaconda时自带的环境，其他环境要想使用必须手动下载一些库：1.首先进入到自己创建的虚拟环境(pytorch是虚拟环境的名字)activate pytorch2.在该环境下下载这个库conda install ipykernelconda install nb__jupyter没有pytorch环境

国内安装scoop的保姆教程_scoop-cn-程序员宅基地

文章浏览阅读5.2k次，点赞19次，收藏28次。选择scoop纯属意外，也是无奈，因为电脑用户被锁了管理员权限，所有exe安装程序都无法安装，只可以用绿色软件，最后被我发现scoop，省去了到处下载XXX绿色版的烦恼，当然scoop里需要管理员权限的软件也跟我无缘了（譬如everything）。推荐添加dorado这个bucket镜像，里面很多中文软件，但是部分国外的软件下载地址在github，可能无法下载。以上两个是官方bucket的国内镜像，所有软件建议优先从这里下载。上面可以看到很多bucket以及软件数。如果官网登陆不了可以试一下以下方式。_scoop-cn

Element ui colorpicker在Vue中的使用_vue el-color-picker-程序员宅基地

文章浏览阅读4.5k次，点赞2次，收藏3次。首先要有一个color-picker组件 <el-color-picker v-model="headcolor"></el-color-picker>在data里面data() { return {headcolor: ’ #278add ’ //这里可以选择一个默认的颜色} }然后在你想要改变颜色的地方用v-bind绑定就好了，例如：这里的:sty..._vue el-color-picker

迅为iTOP-4412精英版之烧写内核移植后的镜像_exynos 4412 刷机-程序员宅基地

文章浏览阅读640次。基于芯片日益增长的问题，所以内核开发者们引入了新的方法，就是在内核中只保留函数，而数据则不包含，由用户（应用程序员）自己把数据按照规定的格式编写，并放在约定的地方，为了不占用过多的内存，还要求数据以根精简的方式编写。boot启动时，传参给内核，告诉内核设备树文件和kernel的位置，内核启动时根据地址去找到设备树文件，再利用专用的编译器去反编译dtb文件，将dtb还原成数据结构，以供驱动的函数去调用。firmware是三星的一个固件的设备信息，因为找不到固件，所以内核启动不成功。_exynos 4412 刷机

Linux系统配置jdk_linux配置jdk-程序员宅基地

文章浏览阅读2w次，点赞24次，收藏42次。Linux系统配置jdkLinux学习教程，Linux入门教程（超详细）_linux配置jdk

随便推点

matlab(4)：特殊符号的输入_matlab微米怎么输入-程序员宅基地

文章浏览阅读3.3k次，点赞5次，收藏19次。xlabel('\delta');ylabel('AUC');具体符号的对照表参照下图：_matlab微米怎么输入

C语言程序设计-文件(打开与关闭、顺序、二进制读写)-程序员宅基地

文章浏览阅读119次。顺序读写指的是按照文件中数据的顺序进行读取或写入。对于文本文件，可以使用fgets、fputs、fscanf、fprintf等函数进行顺序读写。在C语言中，对文件的操作通常涉及文件的打开、读写以及关闭。文件的打开使用fopen函数，而关闭则使用fclose函数。在C语言中，可以使用fread和fwrite函数进行二进制读写。‍ Biaoge 于2024-03-09 23:51发布阅读量：7 ️文章类型：【 C语言程序设计】在C语言中，用于打开文件的函数是____，用于关闭文件的函数是____。

Touchdesigner自学笔记之三_touchdesigner怎么让一个模型跟着鼠标移动-程序员宅基地

文章浏览阅读3.4k次，点赞2次，收藏13次。跟随鼠标移动的粒子以grid（SOP）为partical（SOP）的资源模板，调整后连接【Geo组合+point spirit（MAT)】，在连接【feedback组合】适当调整。影响粒子动态的节点【metaball(SOP)+force(SOP)】添加mouse in（CHOP)鼠标位置到metaball的坐标，实现鼠标影响。..._touchdesigner怎么让一个模型跟着鼠标移动

【附源码】基于java的校园停车场管理系统的设计与实现61m0e9计算机毕设SSM_基于java技术的停车场管理系统实现与设计-程序员宅基地

文章浏览阅读178次。项目运行环境配置：Jdk1.8 + Tomcat7.0 + Mysql + HBuilderX（Webstorm也行）+ Eclispe（IntelliJ IDEA,Eclispe,MyEclispe,Sts都支持）。项目技术：Springboot + mybatis + Maven +mysql5.7或8.0+html+css+js等等组成，B/S模式 + Maven管理等等。环境需要1.运行环境：最好是java jdk 1.8，我们在这个平台上运行的。其他版本理论上也可以。_基于java技术的停车场管理系统实现与设计

Android系统播放器MediaPlayer源码分析_android多媒体播放源码分析时序图-程序员宅基地

文章浏览阅读3.5k次。前言对于MediaPlayer播放器的源码分析内容相对来说比较多，会从Java-&amp;gt;Jni-&amp;gt;C/C++慢慢分析，后面会慢慢更新。另外，博客只作为自己学习记录的一种方式，对于其他的不过多的评论。MediaPlayerDemopublic class MainActivity extends AppCompatActivity implements SurfaceHolder.Cal..._android多媒体播放源码分析时序图

java 数据结构与算法 ——快速排序法-程序员宅基地

文章浏览阅读2.4k次，点赞41次，收藏13次。java 数据结构与算法 ——快速排序法_快速排序法

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

智能推荐

oracle 12c 集群安装后的检查_12c查看crs状态-程序员宅基地

解决jupyter notebook无法找到虚拟环境的问题_jupyter没有pytorch环境-程序员宅基地

国内安装scoop的保姆教程_scoop-cn-程序员宅基地

Element ui colorpicker在Vue中的使用_vue el-color-picker-程序员宅基地

迅为iTOP-4412精英版之烧写内核移植后的镜像_exynos 4412 刷机-程序员宅基地

Linux系统配置jdk_linux配置jdk-程序员宅基地

随便推点

matlab(4)：特殊符号的输入_matlab微米怎么输入-程序员宅基地

C语言程序设计-文件(打开与关闭、顺序、二进制读写)-程序员宅基地

Touchdesigner自学笔记之三_touchdesigner怎么让一个模型跟着鼠标移动-程序员宅基地

【附源码】基于java的校园停车场管理系统的设计与实现61m0e9计算机毕设SSM_基于java技术的停车场管理系统实现与设计-程序员宅基地

Android系统播放器MediaPlayer源码分析_android多媒体播放源码分析时序图-程序员宅基地

java 数据结构与算法 ——快速排序法-程序员宅基地

推荐文章

热门文章

相关标签

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

智能推荐

随便推点

推荐文章

热门文章

相关标签

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