update

Author: kamyu104

0001-1000.md

@@ -17,40 +17,40 @@
 
 ## Algorithms
 
-* [Bit Manipulation](https://github.com/kamyu104/LeetCode-Solutions#bit-manipulation)
-* [Array](https://github.com/kamyu104/LeetCode-Solutions#array)
-* [String](https://github.com/kamyu104/LeetCode-Solutions#string)
-* [Linked List](https://github.com/kamyu104/LeetCode-Solutions#linked-list)
-* [Stack](https://github.com/kamyu104/LeetCode-Solutions#stack)
-* [Queue](https://github.com/kamyu104/LeetCode-Solutions#queue)
-* [Binary Heap](https://github.com/kamyu104/LeetCode-Solutions#binary-heap)
-* [Tree](https://github.com/kamyu104/LeetCode-Solutions#tree)
-* [Hash Table](https://github.com/kamyu104/LeetCode-Solutions#hash-table)
-* [Math](https://github.com/kamyu104/LeetCode-Solutions#math)
-* [Sort](https://github.com/kamyu104/LeetCode-Solutions#sort)
-* [Two Pointers](https://github.com/kamyu104/LeetCode-Solutions#two-pointers)
-* [Recursion](https://github.com/kamyu104/LeetCode-Solutions#recursion)
-* [Binary Search](https://github.com/kamyu104/LeetCode-Solutions#binary-search)
-* [Binary Search Tree](https://github.com/kamyu104/LeetCode-Solutions#binary-search-tree)
-* [Breadth-First Search](https://github.com/kamyu104/LeetCode-Solutions#breadth-first-search)
-* [Depth-First Search](https://github.com/kamyu104/LeetCode-Solutions#depth-first-search)
-* [Backtracking](https://github.com/kamyu104/LeetCode-Solutions#backtracking)
-* [Dynamic Programming](https://github.com/kamyu104/LeetCode-Solutions#dynamic-programming)
-* [Greedy](https://github.com/kamyu104/LeetCode-Solutions#greedy)
-* [Graph](https://github.com/kamyu104/LeetCode-Solutions#graph)
-* [Geometry](https://github.com/kamyu104/LeetCode-Solutions#geometry)
-* [Simulation](https://github.com/kamyu104/LeetCode-Solutions#simulation)
-* [Design](https://github.com/kamyu104/LeetCode-Solutions#design)
-* [Concurrency](https://github.com/kamyu104/LeetCode-Solutions#concurrency)
+* [Bit Manipulation](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#bit-manipulation)
+* [Array](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#array)
+* [String](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#string)
+* [Linked List](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#linked-list)
+* [Stack](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#stack)
+* [Queue](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#queue)
+* [Binary Heap](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#binary-heap)
+* [Tree](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#tree)
+* [Hash Table](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#hash-table)
+* [Math](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#math)
+* [Sort](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#sort)
+* [Two Pointers](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#two-pointers)
+* [Recursion](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#recursion)
+* [Binary Search](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#binary-search)
+* [Binary Search Tree](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#binary-search-tree)
+* [Breadth-First Search](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#breadth-first-search)
+* [Depth-First Search](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#depth-first-search)
+* [Backtracking](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#backtracking)
+* [Dynamic Programming](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#dynamic-programming)
+* [Greedy](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#greedy)
+* [Graph](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#graph)
+* [Geometry](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#geometry)
+* [Simulation](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#simulation)
+* [Design](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#design)
+* [Concurrency](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#concurrency)
 
 ## Database
 
-* [SQL](https://github.com/kamyu104/LeetCode-Solutions#sql)
+* [SQL](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#sql)
 
 
 ## Shell
 
-* [Shell Script](https://github.com/kamyu104/LeetCode-Solutions#shell-script)
+* [Shell Script](https://github.com/kamyu104/LeetCode-Solutions/blob/master/0001-1000.md#shell-script)
 
 ## Reference