《Java语言程序设计与数据结构》编程练习答案（第二十三章）（一）

2024-03-02 13:58
文章标签 java 语言 数据结构 编程 答案 练习 程序设计 第二十三章

本文主要是介绍《Java语言程序设计与数据结构》编程练习答案（第二十三章）（一），希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

《Java语言程序设计与数据结构》编程练习答案（第二十三章）（一）

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

23.1

public class book {public static void main(String[] args) {Scanner input = new Scanner(System.in);}public static <T extends Comparable<T>> void bubbleSort(T[] list){for(int i=list.length-1;i>0;i--){for(int j=0;j<i;j++){if(list[j].compareTo(list[j+1]) > 0){T tmp = list[j];list[j] = list[j+1];list[j+1] = tmp;}}}}public static <T> void bubbleSort (T[] list, Comparator<? super T> comparator){for(int i=list.length-1;i>0;i--){for(int j=0;j<i;j++){if(comparator.compare(list[j],list[j+1]) > 0){T tmp = list[j];list[j] = list[j+1];list[j+1] = tmp;}}}}
}

23.2

public class book {public static void main(String[] args) {Scanner input = new Scanner(System.in);}public static <T extends Comparable<T>> void mergeSort(T[] list){if(list.length > 1){ArrayList<T> tmpLeft = new ArrayList<>(Arrays.asList(list).subList(0, (int) (list.length / 2)));T[] firstHalf = (T[]) tmpLeft.toArray();mergeSort(firstHalf);ArrayList<T> tmpRight = new ArrayList<>(Arrays.asList(list).subList(list.length / 2, list.length));T[] secondHalf = (T[]) tmpRight.toArray();mergeSort(secondHalf);merge(firstHalf, secondHalf, list);}}public static <T extends Comparable<T>>void merge(T[] list1, T[] list2, T[]tmp){int current1 = 0;int current2 = 0;int current3 = 0;while(current1 < list1.length && current2 < list2.length){if(list1[current1].compareTo(list2[current2]) < 0){tmp[current3++] = list1[current1++];}else{tmp[current3++] = list2[current2++];}}while(current1 < list1.length)tmp[current3++] = list1[current1++];while(current2 < list2.length)tmp[current3++] = list2[current2++];}public static <T> void mergeSort(T[] list, Comparator<T> comparator){if(list.length > 1){ArrayList<T> tmpLeft = new ArrayList<>(Arrays.asList(list).subList(0, (int) (list.length / 2)));T[] firstHalf = (T[]) tmpLeft.toArray();mergeSort(firstHalf, comparator);ArrayList<T> tmpRight = new ArrayList<>(Arrays.asList(list).subList(list.length / 2, list.length));T[] secondHalf = (T[]) tmpRight.toArray();mergeSort(secondHalf, comparator);merge(firstHalf, secondHalf, list, comparator);}}public static <T>void merge(T[] list1, T[] list2, T[]tmp, Comparator<T> comparator){int current1 = 0;int current2 = 0;int current3 = 0;while(current1 < list1.length && current2 < list2.length){if(comparator.compare(list1[current1], list2[current2]) < 0){tmp[current3++] = list1[current1++];}else{tmp[current3++] = list2[current2++];}}while(current1 < list1.length)tmp[current3++] = list1[current1++];while(current2 < list2.length)tmp[current3++] = list2[current2++];}
}

23.3

public class book {public static void main(String[] args) {Scanner input = new Scanner(System.in);}public static <T extends Comparable<T>> void quickSort(T[] list){quickSort(list, 0, list.length-1);}public static <T extends Comparable<T>> void quickSort(T[] list, int first, int last){if(last > first){int pivotIndex = partition(list,first, last);quickSort(list, first, pivotIndex-1);quickSort(list, pivotIndex+1, last);}}public static <T extends Comparable<T>>int partition(T[] list, int first, int last){T pivot = list[first];int low = first + 1;int high = last;while(high > low){while(low <= high && list[low].compareTo(pivot) <= 0)low++;while(low <= high && list[high].compareTo(pivot) > 0)high--;if(high > low){T tmp = list[high];list[high] = list[low];list[low] = tmp;}}while (high > first && list[high].compareTo(pivot) >= 0)high--;if(pivot.compareTo(list[high]) > 0){list[first] = list[high];list[high] = pivot;return high;}else{return first;}}public static <T> void quickSort(T[] list, Comparator<T> comparator){quickSort(list, 0, list.length-1, comparator);}public static <T> void quickSort(T[] list, int first, int last, Comparator<T> comparator){if(last > first){int pivotIndex = partition(list,first, last, comparator);quickSort(list, first, pivotIndex-1, comparator);quickSort(list, pivotIndex+1, last, comparator);}}public static <T>int partition(T[] list, int first, int last, Comparator<T> comparator){T pivot = list[first];int low = first + 1;int high = last;while(high > low){while(low <= high && comparator.compare(list[low], pivot) <= 0)low++;while(low <= high && comparator.compare(list[high],pivot) > 0)high--;if(high > low){T tmp = list[high];list[high] = list[low];list[low] = tmp;}}while (high > first && comparator.compare(list[high], pivot) >= 0)high--;if(comparator.compare(pivot, list[high]) > 0){list[first] = list[high];list[high] = pivot;return high;}else{return first;}}
}

23.4

public class book {public static void main(String[] args) {Scanner input = new Scanner(System.in);}public static void quickSort(int[] list){quickSort(list, 0, list.length-1);}public static void quickSort(int[] list, int first, int last){if(last > first){int pivotIndex = partition(list, first, last);quickSort(list, first, pivotIndex-1);quickSort(list, pivotIndex+1, last);}}public static int partition(int[] list, int first, int last){int mid = (first + last) / 2;if((list[first]<list[last] && list[first]>list[mid])||(list[first]<list[mid] && list[first]>list[last])){}else if((list[mid]<list[first] && list[mid]>list[last])||(list[mid]<list[last] && list[mid]>list[first])){int tmp = list[first];list[first] = list[mid];list[mid] = tmp;}else{int tmp = list[first];list[first] = list[last];list[last] = tmp;}int pivot = list[first];int low = first + 1;int high = last;while(high > low){while(low <= high && list[low] <= pivot)low++;while(low <= high && list[high] > pivot)high--;if(high > low){int tmp = list[high];list[high] = list[low];list[low] = tmp;}}while(high > first && list[high] >= pivot)high--;if(pivot > list[high]){list[first] = list[high];list[high] = pivot;return high;}else{return first;}}
}

23.5

public class book {public static void main(String[] args) {Scanner input = new Scanner(System.in);}}class HeapWithComparator<T> {private ArrayList<T> list = new ArrayList<>();private Comparator<? super T>comparator;public HeapWithComparator(){this.comparator = new Comparator<T>() {@Overridepublic int compare(T o1, T o2) {return o1.toString().compareTo(o2.toString());}};}public HeapWithComparator(Comparator<? super T> comparator){this.comparator = comparator;}public void add(T newObject){list.add(newObject);int currentIndex = list.size()-1;while(currentIndex > 0){int parentIndex = (currentIndex-1) / 2;if(comparator.compare(list.get(currentIndex),list.get(parentIndex)) > 0){T tmp = list.get(currentIndex);list.set(currentIndex, list.get(parentIndex));list.set(parentIndex, tmp);}else{break;}currentIndex = parentIndex;}}public T remove(){if(list.size() == 0)return null;T removeObject = list.get(0);list.set(0, list.get(list.size()-1));list.remove(list.size()-1);int currentIndex = 0;while(currentIndex < list.size()){int leftChildIndex = 2*currentIndex + 1;int rightChildIndex = 2*currentIndex + 2;if(leftChildIndex >= list.size())break;int maxIndex = leftChildIndex;if(rightChildIndex < list.size()){if(comparator.compare(list.get(maxIndex), list.get(rightChildIndex)) < 0){maxIndex = rightChildIndex;}}if(comparator.compare(list.get(currentIndex), list.get(maxIndex)) < 0){T tmp = list.get(maxIndex);list.set(maxIndex, list.get(currentIndex));list.set(currentIndex, tmp);currentIndex = maxIndex;}else{break;}}return removeObject;}public int getSize(){return list.size();}}

23.6

public class book {public static void main(String[] args) {Scanner input = new Scanner(System.in);}public static boolean ordered(int[] list){boolean isOrdered = true;for(int i=0;i<list.length-1;i++){if(list[i] > list[i+1]){isOrdered = false;break;}}return isOrdered;}public static boolean ordered(int[] list, boolean ascending){boolean isOrdered = true;if(ascending){for(int i=0;i<list.length-1;i++){if(list[i] > list[i+1]){isOrdered = false;break;}}}else{for(int i=0;i<list.length-1;i++){if(list[i] < list[i+1]){isOrdered = false;break;}}}return isOrdered;}public static boolean ordered(double[] list){boolean isOrdered = true;for(int i=0;i<list.length-1;i++){if(list[i] > list[i+1]){isOrdered = false;break;}}return isOrdered;}public static boolean ordered(double[] list, boolean ascending){boolean isOrdered = true;if(ascending){for(int i=0;i<list.length-1;i++){if(list[i] > list[i+1]){isOrdered = false;break;}}}else{for(int i=0;i<list.length-1;i++){if(list[i] < list[i+1]){isOrdered = false;break;}}}return isOrdered;}public static <T extends Comparable<T>> boolean ordered(T[] list){boolean isOrdered = true;for(int i=0;i<list.length-1;i++){if(list[i].compareTo(list[i+1]) > 0){isOrdered = false;break;}}return isOrdered;}public static <T extends Comparable<T>> boolean ordered(T[] list, boolean ascending){boolean isOrdered = true;if(ascending){for(int i=0;i<list.length-1;i++){if(list[i].compareTo(list[i+1]) > 0){isOrdered = false;break;}}}else{for(int i=0;i<list.length-1;i++){if(list[i].compareTo(list[i+1]) < 0){isOrdered = false;break;}}}return isOrdered;}public static <T> boolean ordered(T[] list, Comparator<? super T> comparator){boolean isOrdered = true;for(int i=0;i<list.length-1;i++){if(comparator.compare(list[i], list[i+1]) > 0){isOrdered = false;break;}}return isOrdered;}public static <T> boolean ordered(T[] list, Comparator<? super T> comparator, boolean ascending){boolean isOrdered = true;if(ascending){for(int i=0;i<list.length-1;i++){if(comparator.compare(list[i], list[i+1]) > 0){isOrdered = false;break;}}}else {for(int i=0;i<list.length-1;i++){if(comparator.compare(list[i], list[i+1]) < 0){isOrdered = false;break;}}}return isOrdered;}
}

这篇关于《Java语言程序设计与数据结构》编程练习答案（第二十三章）（一）的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！


http://www.chinasem.cn/article/766358。

相关文章

JVM 的类初始化机制

JVM 的类初始化机制

前言 当你在 Java 程序中new对象时，有没有考虑过 JVM 是如何把静态的字节码（byte code）转化为运行时对象的呢，这个问题看似简单，但清楚的同学相信也不会太多，这篇文章首先介绍 JVM 类初始化的机制，然后给出几个易出错的实例来分析，帮助大家更好理解这个知识点。 JVM 将字节码转化为运行时对象分为三个阶段，分别是：loading 、Linking、initialization
阅读更多...
Spring Security 基于表达式的权限控制

Spring Security 基于表达式的权限控制

前言 spring security 3.0已经可以使用spring el表达式来控制授权，允许在表达式中使用复杂的布尔逻辑来控制访问的权限。 常见的表达式 Spring Security可用表达式对象的基类是SecurityExpressionRoot。 表达式描述hasRole([role])用户拥有制定的角色时返回true （Spring security默认会带有ROLE_前缀）,去
阅读更多...
浅析Spring Security认证过程

浅析Spring Security认证过程

类图 为了方便理解Spring Security认证流程，特意画了如下的类图，包含相关的核心认证类 概述 核心验证器 AuthenticationManager 该对象提供了认证方法的入口，接收一个Authentiaton对象作为参数; public interface AuthenticationManager {Authentication authenticate(Authenti
阅读更多...
Spring Security--Architecture Overview

Spring Security--Architecture Overview

1 核心组件 这一节主要介绍一些在Spring Security中常见且核心的Java类，它们之间的依赖，构建起了整个框架。想要理解整个架构，最起码得对这些类眼熟。 1.1 SecurityContextHolder SecurityContextHolder用于存储安全上下文（security context）的信息。当前操作的用户是谁，该用户是否已经被认证，他拥有哪些角色权限…这些都被保
阅读更多...
Spring Security基于数据库验证流程详解

Spring Security基于数据库验证流程详解

Spring Security 校验流程图 相关解释说明（认真看哦） AbstractAuthenticationProcessingFilter 抽象类 /*** 调用 #requiresAuthentication(HttpServletRequest, HttpServletResponse) 决定是否需要进行验证操作。* 如果需要验证，则会调用 #attemptAuthentica
阅读更多...
Spring Security 从入门到进阶系列教程

Spring Security 从入门到进阶系列教程

Spring Security 入门系列 《保护 Web 应用的安全》 《Spring-Security-入门（一）：登录与退出》 《Spring-Security-入门（二）：基于数据库验证》 《Spring-Security-入门（三）：密码加密》 《Spring-Security-入门（四）：自定义-Filter》 《Spring-Security-入门（五）：在 Sprin
阅读更多...
Java架构师知识体认识

Java架构师知识体认识

源码分析 常用设计模式 Proxy代理模式Factory工厂模式Singleton单例模式Delegate委派模式Strategy策略模式Prototype原型模式Template模板模式 Spring5 beans 接口实例化代理Bean操作 Context Ioc容器设计原理及高级特性Aop设计原理Factorybean与Beanfactory Transaction 声明式事物
阅读更多...
Java进阶13讲__第12讲_1/2

Java进阶13讲__第12讲_1/2

多线程、线程池 1.  线程概念 1.1  什么是线程 1.2  线程的好处 2.   创建线程的三种方式 注意事项 2.1  继承Thread类 2.1.1 认识  2.1.2  编码实现  package cn.hdc.oop10.Thread;import org.slf4j.Logger;import org.slf4j.LoggerFactory
阅读更多...
JAVA智听未来一站式有声阅读平台听书系统小程序源码

JAVA智听未来一站式有声阅读平台听书系统小程序源码

智听未来，一站式有声阅读平台听书系统 🌟&nbsp;开篇：遇见未来，从“智听”开始 在这个快节奏的时代，你是否渴望在忙碌的间隙，找到一片属于自己的宁静角落？是否梦想着能随时随地，沉浸在知识的海洋，或是故事的奇幻世界里？今天，就让我带你一起探索“智听未来”——这一站式有声阅读平台听书系统，它正悄悄改变着我们的阅读方式，让未来触手可及！ 📚&nbsp;第一站：海量资源，应有尽有 走进“智听
阅读更多...
【数据结构】——原来排序算法搞懂这些就行，轻松拿捏

【数据结构】——原来排序算法搞懂这些就行，轻松拿捏

前言：快速排序的实现最重要的是找基准值，下面让我们来了解如何实现找基准值 基准值的注释：在快排的过程中，每一次我们要取一个元素作为枢纽值，以这个数字来将序列划分为两部分。 在此我们采用三数取中法，也就是取左端、中间、右端三个数，然后进行排序，将中间数作为枢纽值。 快速排序实现主框架： //快速排序 void QuickSort(int* arr, int left, int rig
阅读更多...

Copyright China编程 23002807@qq.com

沪ICP备2023033072号-2