m0_48725491的博客

import java.util.Arrays;public class 位运算 { public static void main(String[] args) { // TODO Auto-generated method stub System.out.println(add(12, 15)); System.out.println(subs(12, 15)); System.out.println(mult(14, 5)); System.out.println(Arra

/** * 操作集合 */import java.util.Collection;import java.util.HashMap;import java.util.function.Predicate;import java.util.function.ToIntFunction;public class Test_Collection { public static void main(String[] args) { HashMap<Integer, S

import java.util.ArrayList;import java.util.List;import java.util.Arrays;import java.util.Random;public class RadixSort { /* * Radix sort an array of Strings * Assume all are all ASCII * Assume all have same length */ publ.

/** * 填坑法实现简易版本，实现好像和下面的一样？？ */import java.util.Arrays;import java.util.Random;public class BinarySort { public static void main(String[] args) { int[] arr = new int[20]; for (int i = 0; i < arr.length; i++) { arr.

/** * 填坑法实现，不需要借助额外数组 */import java.util.Arrays;import java.util.Random;public class BinarySort { public static void main(String[] args) { int[] arr = new int[80]; for (int i = 0; i < arr.length; i++) { arr[i] = n.

public static void main(String[] args) { int[] ar = {1, 4, 3, 5, 7, 11, 9, 10, 0, 1, 6, 3, 5, 4, 8}; heapsort(ar); System.out.println(Arrays.toString(ar)); } public static void shellsort(int[] a) { for (int gap ...

package heap;// BinomialQueue class//// CONSTRUCTION: with no parameters or a single item//// ******************PUBLIC OPERATIONS*********************// void insert( x ) --> Insert x// Comparable deleteMin( )--> Return and remove smallest

package heap;// LeftistHeap class//// CONSTRUCTION: with a negative infinity sentinel//// ******************PUBLIC OPERATIONS*********************// void insert( x ) --> Insert x// Comparable deleteMin( )--> Return and remove smallest ite

package heap;/** * Exception class for access in empty containers * such as stacks, queues, and priority queues. * @author Mark Allen Weiss */public class UnderflowException extends RuntimeException{}

package heap;// BinaryHeap class//// CONSTRUCTION: with optional capacity (that defaults to 100)// or an array containing initial items//// ******************PUBLIC OPERATIONS*********************// void insert( x ) --> Insert

package hash;interface HashFamily<AnyType>{ int hash( AnyType x, int which ); int getNumberOfFunctions( ); void generateNewFunctions( );}import hash.HashFamily;import java.util.Random;public class StringHashFamily implements Has

package hash;import java.util.HashSet;// Cuckoo Hash table class//// CONSTRUCTION: a hashing function family and// an approximate initial size or default of 101//// PUBLIC OPERATIONS***// bool insert( x ) --> Insert x// bool

package hash;import java.util.Random;// Cuckoo Hash table class//// CONSTRUCTION: a hashing function family and// an approximate initial size or default of 101//// PUBLIC OPERATIONS***// bool insert( x ) --> Insert x// bool

https://www.cnblogs.com/dhcao/p/10568822.html

package list;public class MyArrayList<AnyType> implements Iterable<AnyType>{ /** * Construct an empty ArrayList. */ public MyArrayList( ) { doClear( ); } /** * Returns the number of items in th

package list;/** * LinkedList class implements a doubly-linked list. */public class MyLinkedList<AnyType> implements Iterable<AnyType> { /** * Construct an empty LinkedList. */ public MyLinkedList() { doClear();

package tree;// SplayTree class//// CONSTRUCTION: with no initializer//// ******************PUBLIC OPERATIONS*********************// void insert( x ) --> Insert x// void remove( x ) --> Remove x// boolean contains( x ) --> Retu

package tree;// BinarySearchTree class//// CONSTRUCTION: with no initializer//// ******************PUBLIC OPERATIONS*********************// void insert( x ) --> Insert x// void remove( x ) --> Remove x// boolean contains( x ) --&g

package tree;// AvlTree class//// CONSTRUCTION: with no initializer//// ******************PUBLIC OPERATIONS*********************// void insert( x ) --> Insert x// void remove( x ) --> Remove x (unimplemented)// boolean contains( x

package hash;// QuadraticProbing Hash table class//// CONSTRUCTION: an approximate initial size or default of 101//// ******************PUBLIC OPERATIONS*********************// bool insert( x ) --> Insert x// bool remove( x ) --> R