feat: add cpp solution to lc problem: No.0404 (doocs#2587)

close doocs#2600

Author: AlleyNawaz

solution/0400-0499/0404.Sum of Left Leaves/README.md

@@ -252,4 +252,48 @@ int sumOfLeftLeaves(struct TreeNode* root) {
 
 <!-- tabs:end -->
 
+### 方法二
+
+<!-- tabs:start -->
+
+```cpp
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    int sumOfLeftLeaves(TreeNode* root) {
+        if (!root) {
+            return 0;
+        }
+        int ans = 0;
+        stack<TreeNode*> stk{{root}};
+        while (!stk.empty()) {
+            root = stk.top(), stk.pop();
+            if (root->left) {
+                if (!root->left->left && !root->left->right) {
+                    ans += root->left->val;
+                } else {
+                    stk.push(root->left);
+                }
+            }
+            if (root->right) {
+                stk.push(root->right);
+            }
+        }
+        return ans;
+    }
+};
+```
+
+<!-- tabs:end -->
+
 <!-- end -->

solution/0400-0499/0404.Sum of Left Leaves/README_EN.md

@@ -246,4 +246,48 @@ int sumOfLeftLeaves(struct TreeNode* root) {
 
 <!-- tabs:end -->
 
+### Solution 2
+
+<!-- tabs:start -->
+
+```cpp
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    int sumOfLeftLeaves(TreeNode* root) {
+        if (!root) {
+            return 0;
+        }
+        int ans = 0;
+        stack<TreeNode*> stk{{root}};
+        while (!stk.empty()) {
+            root = stk.top(), stk.pop();
+            if (root->left) {
+                if (!root->left->left && !root->left->right) {
+                    ans += root->left->val;
+                } else {
+                    stk.push(root->left);
+                }
+            }
+            if (root->right) {
+                stk.push(root->right);
+            }
+        }
+        return ans;
+    }
+};
+```
+
+<!-- tabs:end -->
+
 <!-- end -->

solution/0400-0499/0404.Sum of Left Leaves/Solution2.cpp

@@ -0,0 +1,35 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    int sumOfLeftLeaves(TreeNode* root) {
+        if (!root) {
+            return 0;
+        }
+        int ans = 0;
+        stack<TreeNode*> stk{{root}};
+        while (!stk.empty()) {
+            root = stk.top(), stk.pop();
+            if (root->left) {
+                if (!root->left->left && !root->left->right) {
+                    ans += root->left->val;
+                } else {
+                    stk.push(root->left);
+                }
+            }
+            if (root->right) {
+                stk.push(root->right);
+            }
+        }
+        return ans;
+    }
+};