切换
21文档网
类库大全
IT社区
开源文档
示例代码
速查表
在线工具
语言基础
数据结构
数据结构
算法
Eight Queen Problem
Java Collection Create Anagrams algorithm
Java Print all permutation groups above size threshold
Java Collection Algorithm: Deal cards
Reverse words in a file within Thread
Check to see if a string is a Palindrome String
Swap Numbers Without Using Third Variable
Create Fibonacci Series
Convert binary number to decimal number
Factorial Using Recursion
Read Number from Console and Check if it is a Palindrome Number
How to generate prime numbers between 1 and given number using for loop
is Anagram between two String value
A method to determine if two string are anagrams, will return true if the strings are the same
Make all combinations of N size of objects
permutations With First Element
背包
Create a generic Bag data structure
二分查找
Use binary search to locate an item in an array.
Uses binary searching to check if a String is already in a String[].
Binary search your int array
缓存
LRU cache based on HashMap
Concurrent LRU Cache
Least Frequent Used Cache
Generic LRU cache
双端队列
generic Deque
DNA
Return the reverse complement version of a DNA string in upper case.
determines the reverse of a part of a sequence of nucleotides.
determines the complement of a sequence of nucleotides.
Return array of all stop codons for the configured genetic code - stop codons as 3 letter nucleotide letters eg "TGA"
determines the reverse complement of a sequence of nucleotides.
determines the reverse of a sequence of nucleotides.
gets a translation into amino acids of a string of nucleotides.
Transform (in-situ) a human-readable DNA sequence into internal 0..4 bytes.
Transform a human-readable DNA sequence into internal 0..4 bytes.
Convert a FASTQ string to a byte array of phred scores.
Convert an array of bytes, in which each byte is a binary phred quality score, to printable ASCII re
Take reverse complement of a string.
Convert a number into a string of nucleotide codes.
get JTabbedPane Tab Area Bounds
英语语言
is Preposition English Word
图
Shortest path between all the pairs of nodes
Creates a directed graph based on URL objects that represents link structure using jgrapht
an implementation of Dijakstra algorithm.
Breadth First Search or BFS for a Graph
Deepest First Search or DFS for a Graph
Dijkstra algorithm
堆
Generic Heap
逆波兰表达式
calculate Inverse Poland Expression
get Inverse Poland Expression
get Calculate String Value, like (1+3)*5+5
convert expression To Postfix
列表
Custom List class with custom ListNode
Create your own LinkedList
Implement Linked list with insert and delete functions
Implements a Queue (FIFO) with linked-list.
Doubly LinkedList
Singly LinkedList
矩阵
Deep copy int Matrix
Create Magic Cube Path using two dimensional array
From A Given Matrix Extract Majors Values By Rows, Columns, Primary Diagonal, Secondary Diagonal And Whole Array
Bi dimensional Array, Rhombus Path Build.
Bi dimensional Array, Right To Left Pattern Build.
Bi dimensional Array, Spiral Pattern Build. Type 1: In-Out.
Bi dimensional Array, Spiral Pattern Build. Type 2: Out-In.
Bi dimensional Array, Up-Down Pattern Build.
Bi dimensional Array Zig-Zag Path Build.
Multiplies 2 matrices in O(n^3) time
Add two Matrix together
rotate matrix
create Matrix and transpose the matrix
Write code to do Matrix Diagonals Sum
Write code to Add two matrix and subtract matrix
Find pattern in matrix
队列
Implements a Priority Queue unordered that iterates over the smallest key.
Implements a Priority Queue unordered that iterates over the largest key.
Implements a Priority Queue ordered that iterates over the smallest key.
Randomized Queue
Generic Queue Array Resize
Generic Queue
Non generic Dequeue
Generic min priority queue implementation with a binary heap
The Queue class represents a first-in-first-out (FIFO) queue of generic items.
Implements a priority queue using a max heap. The heap is of fixed size and represented using an array.
搜索
Sequentially searching an array for an item.
Recursive binary search method
Implement Recursive Binary Search
Function for binary search
Search pattern in a string, return all offset index
Function for int array linear search
Java Implementation of Interpolation Search
Recursive Binary Search
排序
Selection Sort objects
Selection sort an int array
Sorting an array with selection sort.
Sorting an array with insertion sort.
Sorting an array with merge sort.
Java Bubble Sort Descending Order
Java Bubble Sort
Sort an array with quick sort
Returns an alphabetically sorted copy of vector.
heap Sort
quick Sort
A generic method for insertion Sort.
Returns the sorted version of the input string.
Sort two homogeneous collections and merge them, all according to the given comparator.
merge Sort
Merge two homogeneous pre-sorted iterable inputs.
insertion Sort int array
Performs an optimized quicksort of the specified array, using the specified comparator.
Bubble Sort int array
quick sort int array
Quick sort on array of int
Insertion sort on int array
Java implementation of Counting Sort
function for bubble sort
Java implementation of Shell Sort
function for selection sort
Java Implementation of Radix Sort
Java implementation for quick sort
Java implementation of merge sort
function for insertion sort
Implement heap sort
Implements a simple a binary search in a array (sorted).
Implements a Shellsort
Implements a Selection sort
example of Mergesort
Implements a Bottom-up Mergesort, without recursion.
Implements a Mergesort.
Implements a Insertion sort
Implements a Heapsort
堆栈
Create stack to store int value
Create custom stack to hold Integer
Create stack class for Object
Create stack for int value
Create your own stack
Create Stack based on int array
A Stack of Strings by array
Implements a Stack using array, with fixed size.
Generic Stack
Growing Stack
状态机
squirrel framework State Machine
树
Binary tree test program.
Declare a node class as a node of a binary search tree
Create Binary Search Tree
Algorithm for binary Tree Level Travel
Implements a
red-black Binary Search Tree
, maintains symmetric order and perfect black balance.
Implements a B-Trees
Implements a Binary Search Tree in symmetric order.
A simple implementation of a binary search tree (unbalanced).
Search Tree
Given a binary tree, print out the nodes in order without using recursion.
AVL tree, self-balancing binary search tree.