Create MQQM.cpp

MQQM · web-flow · commit 08c40f5f1c5c · 2018-12-06T20:17:28.000+08:00
diff --git a/2018.12.07-leetcode104/MQQM.cpp b/2018.12.07-leetcode104/MQQM.cpp
@@ -0,0 +1,24 @@
+/*
+  题目：
+  给定一个二叉树，找出其最大深度。二叉树的深度为根节点到最远叶子节点的最长路径上的节点数
+*/
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class Solution {
+public:
+    int maxDepth(TreeNode* root) {
+        if(root==NULL)
+            return 0;
+        int leftDepth = maxDepth(root->left);
+        int rightDepth = maxDepth(root->right);
+        return (leftDepth > rightDepth) ? leftDepth+1 : rightDepth+1 ;
+    }
+};
