Update #320

codes/cpp/chapter_heap/heap.cpp

@@ -12,6 +12,7 @@ void testPush(priority_queue<int> &heap, int val)
     cout << "\n元素 " << val << " 入堆后" << endl;
     PrintUtil::printHeap(heap);
 }
+
 void testPoll(priority_queue<int> &heap)
 {
     int val = heap.top();

codes/cpp/chapter_heap/my_heap.cpp

@@ -1,3 +1,9 @@
+/**
+ * File: my_heap.cpp
+ * Created Time: 2023-02-03
+ * Author: what-is-me (whatisme@outlook.jp)
+ */
+
 #include "../include/include.hpp"
 
 /* 最大堆类 */

codes/cpp/chapter_tree/avl_tree.cpp

@@ -1,6 +1,6 @@
 /**
  * File: avl_tree.cpp
- * Created Time: 2023-2-3
+ * Created Time: 2023-02-03
  * Author: what-is-me (whatisme@outlook.jp)
  */