"feat: add cpp solution to lcof2 problem: NO.044 (doocs#565)

* lcof2/剑指 Offer II 006. 排序数组中两个数字之和 cpp solution

* Update lcof2/剑指 Offer II 006. 排序数组中两个数字之和/README.md

* feat: add cpp solution to lcof2 problem: NO.044

Co-authored-by: willrlzhang <willrlzhang@tencent.com>
Co-authored-by: Yang Libin <contact@yanglibin.info>

Author: 3 people

lcof2/剑指 Offer II 044. 二叉树每层的最大值/README.md

@@ -93,10 +93,57 @@
 
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> largestValues(TreeNode* root) {
+        vector<int> res;
+        if( !root )
+        {
+            return res;
+        }
+
+        deque<TreeNode* > deq;
+        deq.push_back(root);
+        while( !deq.empty())
+        {
+            int size = deq.size();
+            int maxnum = INT_MIN;
+            for (int i = 0; i < size; i++)
+            {
+                TreeNode* ptr = deq.front();
+                deq.pop_front();
+                if(maxnum < ptr->val)
+                {
+                    maxnum = ptr->val;
+                }
+
+                if(ptr->left)
+                {
+                    deq.push_back(ptr->left);
+                }
+
+                if(ptr->right)
+                {
+                    deq.push_back(ptr->right);
+                }
+            }
+
+            res.push_back(maxnum);
+        }
+
+        return res;
+    }
+};
+```
+
 ### **...**
 
 ```
 
 ```
 
 <!-- tabs:end -->
+

lcof2/剑指 Offer II 044. 二叉树每层的最大值/Solution.cpp

@@ -0,0 +1,41 @@
+class Solution {
+public:
+    vector<int> largestValues(TreeNode* root) {
+        vector<int> res;
+        if( !root )
+        {
+            return res;
+        }
+
+        deque<TreeNode* > deq;
+        deq.push_back(root);
+        while( !deq.empty())
+        {
+            int size = deq.size();
+            int maxnum = INT_MIN;
+            for (int i = 0; i < size; i++)
+            {
+                TreeNode* ptr = deq.front();
+                deq.pop_front();
+                if(maxnum < ptr->val)
+                {
+                    maxnum = ptr->val;
+                }
+
+                if(ptr->left)
+                {
+                    deq.push_back(ptr->left);
+                }
+
+                if(ptr->right)
+                {
+                    deq.push_back(ptr->right);
+                }
+            }
+
+            res.push_back(maxnum);
+        }
+
+        return res;
+    }
+};