remove useless includes

lxylxy123456 · lxylxy123456 · commit 388bdc3aeeef · 2018-07-14T13:35:24.000+08:00
diff --git a/BTree.cpp b/BTree.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_BTree
 #define FUNC_BTree
 
-#include <vector>
 #include <map>
 #include "utils.h"
 
diff --git a/BinarySearchTree.cpp b/BinarySearchTree.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_BinarySearchTree
 #define FUNC_BinarySearchTree
 
-#include <vector>
 #include <cassert>
 #include "utils.h"
 #include "BinaryTree.cpp"
diff --git a/BinaryTree.cpp b/BinaryTree.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_BinaryTree
 #define FUNC_BinaryTree
 
-#include <vector>
 #include "utils.h"
 #include "printtree.h"
 
diff --git a/BucketSort.cpp b/BucketSort.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_BucketSort
 #define FUNC_BucketSort
 
-#include <vector>
 #include <cassert>
 #include "utils.h"
 #include "InsertSort.cpp"
diff --git a/ChainedHash.cpp b/ChainedHash.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_ChainedHash
 #define FUNC_ChainedHash
 
-#include <vector>
 #include "utils.h"
 #include "LinkedList.cpp"
 
diff --git a/CountingSort.cpp b/CountingSort.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_CountingSort
 #define FUNC_CountingSort
 
-#include <vector>
 #include "utils.h"
 
 template <typename T>
diff --git a/CutRod.cpp b/CutRod.cpp
@@ -26,7 +26,6 @@
 
 #define CUT_ROD_INFO std::pair<T, std::vector<size_t>>
 
-#include <vector>
 #include <iomanip>
 #include <map>
 #include "utils.h"
diff --git a/DirectAddress.cpp b/DirectAddress.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_DirectAddress
 #define FUNC_DirectAddress
 
-#include <vector>
 #include "utils.h"
 
 template <typename T>
diff --git a/FibHeap.cpp b/FibHeap.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_FibHeap
 #define FUNC_FibHeap
 
-#include <vector>
 #include "utils.h"
 
 template <typename T>
diff --git a/Hash.cpp b/Hash.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_Hash
 #define FUNC_Hash
 
-#include <vector>
 #include "utils.h"
 
 class DivisionHash {
diff --git a/HireAssistant.cpp b/HireAssistant.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_HireAssistant
 #define FUNC_HireAssistant
 
-#include <vector>
 #include <cassert>
 #include "utils.h"
 
diff --git a/InsertSort.cpp b/InsertSort.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_InsertSort
 #define FUNC_InsertSort
 
-#include <vector>
 #include "utils.h"
 
 template <typename T>
diff --git a/IntervalTree.cpp b/IntervalTree.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_IntervalTree
 #define FUNC_IntervalTree
 
-#include <vector>
 #include <cassert>
 #include "utils.h"
 #include "RedBlackTree.cpp"
diff --git a/LinkedList.cpp b/LinkedList.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_LinkedList
 #define FUNC_LinkedList
 
-#include <vector>
 #include <exception>
 #include "utils.h"
 
diff --git a/MaxHeap.cpp b/MaxHeap.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_MaxHeap
 #define FUNC_MaxHeap
 
-#include <vector>
 #include <exception>
 #include "utils.h"
 
diff --git a/MergeSort.cpp b/MergeSort.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_MergeSort
 #define FUNC_MergeSort
 
-#include <vector>
 #include <list>
 #include <cassert>
 #include "utils.h"
diff --git a/Minimum.cpp b/Minimum.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_Minimum
 #define FUNC_Minimum
 
-#include <vector>
 #include "utils.h"
 
 class Value {
diff --git a/OnLineMaximum.cpp b/OnLineMaximum.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_OnLineMaximum
 #define FUNC_OnLineMaximum
 
-#include <vector>
 #include <cassert>
 #include <algorithm>
 #include "utils.h"
diff --git a/OpenAddress.cpp b/OpenAddress.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_OpenAddress
 #define FUNC_OpenAddress
 
-#include <vector>
 #include <exception>
 #include "utils.h"
 
diff --git a/OrderStatisticTree.cpp b/OrderStatisticTree.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_OrderStatisticTree
 #define FUNC_OrderStatisticTree
 
-#include <vector>
 #include <cassert>
 #include "utils.h"
 #include "RedBlackTree.cpp"
diff --git a/Queue.cpp b/Queue.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_Queue
 #define FUNC_Queue
 
-#include <vector>
 #include <exception>
 #include "utils.h"
 
diff --git a/Quicksort.cpp b/Quicksort.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_Quicksort
 #define FUNC_Quicksort
 
-#include <vector>
 #include "utils.h"
 
 template <typename T>
diff --git a/RadixSort.cpp b/RadixSort.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_RadixSort
 #define FUNC_RadixSort
 
-#include <vector>
 #include "utils.h"
 #include "CountingSort.cpp"
 
diff --git a/RandomPermute.cpp b/RandomPermute.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_RandomPermute
 #define FUNC_RandomPermute
 
-#include <vector>
 #include <map>
 #include "utils.h"
 
diff --git a/RandomizedSelect.cpp b/RandomizedSelect.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_RandomizedSelect
 #define FUNC_RandomizedSelect
 
-#include <vector>
 #include "utils.h"
 #include "Quicksort.cpp"
 
diff --git a/RedBlackTree.cpp b/RedBlackTree.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_RedBlackTree
 #define FUNC_RedBlackTree
 
-#include <vector>
 #include <cassert>
 #include "utils.h"
 #include "BinarySearchTree.cpp"
diff --git a/Select.cpp b/Select.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_Select
 #define FUNC_Select
 
-#include <vector>
 #include "utils.h"
 #include "InsertSort.cpp"
 
diff --git a/Stack.cpp b/Stack.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_Stack
 #define FUNC_Stack
 
-#include <vector>
 #include <exception>
 #include "utils.h"
 
diff --git a/StorageManage.cpp b/StorageManage.cpp
@@ -24,7 +24,6 @@
 #ifndef FUNC_StorageManage
 #define FUNC_StorageManage
 
-#include <vector>
 #include <cassert>
 #include <exception>
 #include "utils.h"
