博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
《Java语言程序设计与数据结构》编程练习答案(第七章)(二)
阅读量:4169 次
发布时间:2019-05-26

本文共 6734 字,大约阅读时间需要 22 分钟。

《Java语言程序设计与数据结构》编程练习答案(第七章)(二)

英文名:Introduction to Java Programming and Data Structures, Comprehensive Version, 11th Edition

7.14

import java.util.Scanner;public class book {
public static void main(String[] args) {
System.out.print("Enter 5 numbers: "); Scanner input = new Scanner(System.in); int[] ass = new int[5]; for(int i=0;i<5;i++) {
ass[i]=input.nextInt(); } System.out.println("The gcd of the numbers is "+gcd(ass)); } public static int gcd(int... numbers) {
if(numbers.length==1) return numbers[0]; else if(numbers.length==2) return gcd(numbers[0],numbers[1]); else {
int gcd = gcd(numbers[0],numbers[1]); for(int i=2;i
=2) gkd--; return gkd; }}

7.15

import java.util.Scanner;public class book {
public static void main(String[] args) {
System.out.print("Enter 10 numbers: "); Scanner input = new Scanner(System.in); int[] ass = new int[10]; for(int i=0;i<10;i++) {
ass[i]=input.nextInt(); } int[] jj = eliminateDuplications(ass); System.out.print("The distinct numbers are: "); for (int value : jj) System.out.print(value + " "); } public static int[] eliminateDuplications(int[] list) {
int ptr = 0; int len = list.length; int[] ass = new int[len]; for (int item : list) {
int occur = 0; for (int j=0;j

7.16

public class book {
public static void main(String[] args) {
int[] million = createRandomArray(); int kk = (int)(Math.random()*100000); long startTime = System.nanoTime(); linearSearch(kk,million); long endTime = System.nanoTime(); long timel = endTime-startTime; sort(million); startTime = System.nanoTime(); binarySearch(kk,million); endTime = System.nanoTime(); long timeb = endTime-startTime; System.out.println("The time of linear search is "+timel+", and the time of binary search is "+timeb); } public static int[] createRandomArray() {
int[] ass = new int[100000]; for(int i=0;i<100000;i++) ass[i]=(int)(100000*Math.random()); return ass; } public static int linearSearch(int key,int[] ass) {
int jb=-1; for(int i=0;i
=2;i--) {
for(int j=0;j
ass[j+1]) {
int tmp = ass[j]; ass[j] = ass[j+1]; ass[j+1]=tmp; } } } } public static int binarySearch(int key,int[] ass) {
int jb=-1; int high=ass.length-1; int low=0; while(high>=low) {
int mid=(high+low)/2; if(ass[mid]==key) jb=mid; else if(ass[mid]

7.17

import java.util.Scanner;public class book {
public static void main(String[] args) {
Scanner input = new Scanner(System.in); System.out.print("Enter the number of students: "); int num = input.nextInt(); String[] ass = new String[num]; System.out.print("Enter the names of the students: "); for(int i=0;i
=2;j--) {
for(int i=0;i

7.18

见7.16

👨🐰🌶

7.19

import java.util.Scanner;public class book {
public static void main(String[] args) {
Scanner input = new Scanner(System.in); System.out.print("Enter the size of the list: "); int num = input.nextInt(); int[] ass = new int[num]; System.out.print("Enter the contents of the list: "); for(int i=0;i
list[i+1]) return false; } } return true; }}

7.20

import java.util.Scanner;public class book {
public static void main(String[] args) {
Scanner input = new Scanner(System.in); System.out.print("Enter 10 doubles: "); double[] ass = new double[10]; for(int i=0;i<10;i++) ass[i]=input.nextDouble(); selectionSort(ass); for(int i=0;i<10;i++) System.out.print(ass[i]+" "); } public static void selectionSort(double[] list) {
for(int i=0;i

7.21

import java.util.Scanner;public class book {
public static void main(String[] args) {
int sum=0; for(int i=0;i

7.22

public class book {
public static void main(String[] args) {
int count=0; String ass = args[0]; int len = ass.length(); for(int i=0;i
='A') count++; } System.out.print("There are "+count+" numbers."); }}

7.23

public static void main(String[] args)    {        boolean[] ass = new boolean[101];        for(boolean dick:ass)dick=false;        for(int i=1;i<=100;i++)        {            int base=i;            while(base<=100)            {                ass[base]=!ass[base];                base+=i;            }        }        for(int i=1;i<=100;i++)        {            if(ass[i])                System.out.print(i+" ");        }    }}

7.24

public class book {
public static void main(String[] args) {
int[] pattern = new int[4]; int countPick = 0; int countPattern = 0; while(countPattern<4) {
int card = (int)(Math.random()*52); countPick++; if(pattern[card/13]==0) {
pattern[card / 13] = card; countPattern++; } } String[] dock = {
"Spades","Clubs","Hearts","Diamonds"}; String[] point={
"Ace","2","3","4","5","6","7","8","9","10","Jack","Queen","King"}; for(int i=0;i<4;i++) System.out.printf("%s of %s\n",point[pattern[i]%13],dock[i]); System.out.println("Number of picks: "+countPick); }}

7.25

import java.util.Scanner;public class book {
public static void main(String[] args) {
Scanner input = new Scanner(System.in); System.out.print("Enter a b c: "); double[] s = new double[3]; for(int i=0;i<3;i++) s[i]=input.nextDouble(); double[] r = new double[2]; int ass = solveQuadratic(s,r); System.out.println(ass +" roots"); for(int i=0;i

7.26

import java.util.Scanner;public class book {
public static void main(String[] args) {
Scanner input = new Scanner(System.in); System.out.print("Enter list1 size and contents: "); int s1 = input.nextInt(); int[] l1 = new int[s1]; for(int i=0;i

转载地址:http://nuwai.baihongyu.com/

你可能感兴趣的文章
java String于常量池中的介绍
查看>>
java Text 错误: 找不到或无法加载主类 Text
查看>>
XShell连接ubantu:给ubantu安装ssh
查看>>
c语言的null和0
查看>>
二进制详解:世界上有10种人,一种懂二进制,一种不懂。
查看>>
c语言一个字符变量存储多个字符
查看>>
java接口中方法的默认访问修饰符为public
查看>>
java多线程之并发synchronized
查看>>
java多线程之并发Lock
查看>>
微信公众平台基础配置
查看>>
jpa 和 hibernate 的联系
查看>>
SpringBoot之@SpringBootApplication注解
查看>>
ajax 传JSON 写法
查看>>
SpringBoot之web发展史
查看>>
SpringBoot之开发web页面
查看>>
SpringBoot之快速部署
查看>>
springBoot之jar包在后台(运行:编写start、stop脚本)
查看>>
redis学习
查看>>
SpringBoot之application.properties文件能配置的属性
查看>>
javaWeb监听器、过滤器、拦截器
查看>>