LeetCode-算法总结

Array: 矩阵;
Hash Table:哈希;
Linked List:链表;
Math:数学;
Two Pointers:双指针;
Sting:字符串;
Divide and Conquer:分治;
Binary Search:二分;
Dynamic Programming:动态规划;
Backtracking:回溯;+++++++++++++
Stack:堆栈;
Heap:队列;
Greedy:贪心;
Sort:排序;
Bit Manipulation:位操作+++++++++
Tree:树;
Depth-first-Search:深度优先遍历;
Breadth-first-Search:广度优先遍历;
Union Find(并查集):++++++++++++
Graph:图+++++++++
Design:+++++++++
Topological Sort(图算法):+++++
Tire(字典树):++++++++++

Binary Search Tree:二叉搜索树;
Recursion:递归;
Segment Tree(线段树):++++++++++

Binary Indexed Tree(树状数组):++++++++++

Brainteser+++++++




















你可能感兴趣的:(LeetCode)