qq_44574863的博客

public class InsertValueSearch { public static void main(String[] args) { int[] a = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; System.out.println(insertValueSearch(a, 0, a.length - 1, 4)); } /** * 插值查找 * 查找的数组必须是有序！ * 适用于：数

public class InsertValueSearch { public static void main(String[] args) { int[] a = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; System.out.println(insertValueSearch(a, 0, a.length - 1, 4)); } /** * 插值查找 * 查找的数组必须是有序！ * 适用于：数

import java.util.Arrays;public class FibonacciSearch { public static int maxSize = 20; public static void main(String[] args) { int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9}; System.out.println(fibSearch(arr,1)); } //构造斐波那契数列

import java.util.ArrayList;import java.util.Comparator;import java.util.List;public class BinarySearch {public static void main(String[] args) { /*int[] a = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; System.out.println(binarySearch1(a, 0, a.length - 1, 0)

![在这里插入图片描述](https://img-blog.csdnimg.cn/20200530211324498.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQ01，冒泡排序import java.text.SimpleDateFormat;import java.util.Arrays;import java.util.D.

package PolandNotation;import java.util.ArrayList;import java.util.List;import java.util.Stack;public class PolandNotation { public static void main(String[] args) { //计算逆波兰表达式 ...

package LinkStack;public class LinkStack { Node top=null; //栈空 public boolean isEmpty(){ return top==null; } //入栈 public void push(Node node){ //如果是第一个节点 ...

package Calculator;import java.util.Stack;public class Calculator { //数栈 Stack<Double> numStack = new Stack<>(); //运算符栈 Stack<Character> operStack = new Stack<...

package ArrayStack;public class ArrayStack { private int maxSize;//栈的大小 private int[] stack;//数组模拟栈 private int top=-1;//栈顶指针 public ArrayStack() { } //构造器 public Array...

import java.util.Arrays;public class Queue8 { //皇后个数 int max = 8; //用一维数组来表示棋盘，索引代表行，数值代表列 int[] array = new int[max]; static int count = 0;//计算总共有多少方法 static int judgeCount ...

import java.util.*;public class Labyrinth { public static Stack<String>stack=new Stack<>(); public static void main(String[] args) { //使用二维数组，模拟迷宫 int[][] map = n...

import java.util.Scanner;public class CircleArrayDemo { public static void main(String[] args) { CircleArray queue=new CircleArray(3); boolean loop=true; char choose=' ';...

import java.util.Scanner;public class ArrayQueueDemo { public static void main(String[] args) { //创建队列 ArrayQueue queue=new ArrayQueue(3); char key=' ';//接受用户输入 S...

package Josepfu;public class Boy { private int no;//编号 private Boy next;//指向下一个节点，默认为null public Boy(int no) { this.no = no; } public int getNo() { return no; ...

package DoubleLinkedList;public class HeroNode2{ //数据域 private int no; private String name; private String nickname; //指针域 private HeroNode2 next;//指向下一个结点 private HeroNo...

package SingleLinkedList;//链表结点public class HeroNode { //数据域 public int no; public String name; public String nickname; //指针域 public HeroNode next; //构造器 public Her...

import java.io.*;import java.util.Arrays;public class SparseArray { public static void main(String[] args) { //创建一个原始的二维数组11*11 //0:表示没有棋子，1：表示黑子；2：表示蓝子 int chessArr1[]...