init

else/topic/2017.h

@@ -0,0 +1,76 @@
+#include "../structs/Tree.h"
+#include <queue>
+
+using namespace std;
+
+void reversechild(TreeNode *root)
+{
+    TreeNode *head = root;
+    queue<TreeNode *> q;
+    q.push(head);
+    while (!q.empty())
+    {
+        head = q.front();
+        q.pop();
+        if (head->left)
+        {
+            q.push(head->left);
+        }
+        if (head->right)
+        {
+            q.push(head->right);
+        }
+        swap(head->left, head->right);
+    }
+}
+
+#include <unordered_map>
+#include <vector>
+
+using namespace std;
+
+unordered_map<int, int> statistic(vector<int> L1)
+{
+    unordered_map<int, int> m;
+    for (auto i : L1)
+    {
+        m[i] = m[i] + 1;
+    }
+    return m;
+}
+
+#include "../structs/List.h"
+
+ListNode *integrateList(LitNode *L1, ListNode *l2)
+{
+    ListNode *head = L1->value < L2->value ? L1 : L2;
+    if (L1->value < L2->value)
+    {
+        L1 = L1->next;
+    }
+    else
+    {
+        L2 = L2->next;
+    }
+    ListNode *temp = head->next;
+    while (L1 && L2)
+    {
+        temp->next = L1->value < L2->value ? L1 : L2;
+        if (L1->value < L2->value)
+        {
+            L1 = L1->next;
+        }
+        else
+        {
+            L2 = L2->next;
+        }
+        temp = temp->next;
+    }
+    if(L1){
+        temp->next = L1;
+    }
+    if(L2){
+        temp->next = L2;
+    }
+    return head;
+}