README
¶
Data structures & Algorithms
Data structures and algorithms in go.
Online Judge
Data structures
- 栈（Stack）
- 队列（Queue）
- 树（Tree）
- 树状数组（Binary Indexed Tree）
- 前缀树（Trie）
- 图（Graph）
- 堆（Heap）
- 优先队列（Priority Queue）
- 散列表（Hash Table）
- 并查集（Union-Find）
Others
Algorithms
Sorting algorithms
- 冒泡排序（Bubble Sort）
- 堆排序（Heap Sort）
- 快速排序（Quick Sort）
- 归并排序（Merge Sort）
- 插入排序（Insertion Sort）
- 希尔排序（Shell Sort）
- 选择排序（Selection Sort）
- 基数排序（Radix Sort）
Searching algorithms
Directories
¶
| Path | Synopsis |
|---|---|
|
data-structure
|
|
|
leetcode
|
|
|
array
https://leetcode.com/problems/add-to-array-form-of-integer/description/ For a non-negative integer X, the array-form of X is an array of its digits in left to right order.
|
https://leetcode.com/problems/add-to-array-form-of-integer/description/ For a non-negative integer X, the array-form of X is an array of its digits in left to right order. |
|
bit-manipulation
https://leetcode.com/problems/number-of-1-bits/ Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight).
|
https://leetcode.com/problems/number-of-1-bits/ Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight). |
|
dynamic-programming
https://leetcode.com/problems/climbing-stairs/#/description ou are climbing a stair case.
|
https://leetcode.com/problems/climbing-stairs/#/description ou are climbing a stair case. |
|
hash-table
https://leetcode.com/problems/find-common-characters/description/ Given an array A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including duplicates).
|
https://leetcode.com/problems/find-common-characters/description/ Given an array A of strings made only from lowercase letters, return a list of all characters that show up in all strings within the list (including duplicates). |
|
linked-list
https://leetcode.com/problems/add-two-numbers/#/description You are given two non-empty linked lists representing two non-negative integers.
|
https://leetcode.com/problems/add-two-numbers/#/description You are given two non-empty linked lists representing two non-negative integers. |
|
math
https://leetcode.com/problems/palindrome-number/#/description Determine whether an integer is a palindrome.
|
https://leetcode.com/problems/palindrome-number/#/description Determine whether an integer is a palindrome. |
|
others
https://leetcode.com/problems/poor-pigs/description/ There are 1000 buckets, one and only one of them contains poison, the rest are filled with water.
|
https://leetcode.com/problems/poor-pigs/description/ There are 1000 buckets, one and only one of them contains poison, the rest are filled with water. |
|
stack
https://leetcode.com/problems/min-stack/#/description Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.
|
https://leetcode.com/problems/min-stack/#/description Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. |
|
string
https://leetcode.com/problems/add-binary/#/description Given two binary strings, return their sum (also a binary string).
|
https://leetcode.com/problems/add-binary/#/description Given two binary strings, return their sum (also a binary string). |
|
tree
https://leetcode.com/problems/increasing-order-search-tree/ Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, \ and every node has no left child and only 1 right child.
|
https://leetcode.com/problems/increasing-order-search-tree/ Given a tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, \ and every node has no left child and only 1 right child. |
|
search
|
|
|
sorting
|
|
|
string
|
|
Click to show internal directories.
Click to hide internal directories.