Merge pull request gzc426#335 from zchoas/master

gzc426 · web-flow · commit 1a09a8025d61 · 2018-12-06T22:09:24.000+08:00
Create58&amp;&amp;101
diff --git a/2018.12.07-leetcode104/张小胖.md b/2018.12.07-leetcode104/张小胖.md
@@ -0,0 +1,19 @@
+    /**
+     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==nullptr) return 0;
+            int leftDepth=maxDepth(root->left);
+            int rightDepth=maxDepth(root->right);
+             if(leftDepth>rightDepth) return leftDepth+1;
+             else return rightDepth+1;
+        }
+    };
diff --git a/2018.12.3-leetcode58/张小胖.md b/2018.12.3-leetcode58/张小胖.md
@@ -0,0 +1,20 @@
+    class Solution{
+    public:
+          int lengthOfLastWorld(string s){
+            int slength=s.size();
+            int i=slength-1,length=0;
+            if(s.size()==0)return 0;
+            for(i;i>=0;i--)
+            {
+               if(s[i]!=' ')
+               {
+                  break;
+                }
+             }
+             for(i;s[i]!=' '&&i>=0;i--)
+             {
+                length++;
+              }
+              return length;
+            }
+       };
diff --git a/2018.12.4-leetcode101/张小胖.md b/2018.12.4-leetcode101/张小胖.md
@@ -0,0 +1,25 @@
+    /**
+    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:
+       bool isSymmetric(TreeNode* root){
+          if(root==0)
+              return true;
+           return CompareNodes(root->left,root->right);
+       }
+        public:
+        bool CompareNodes(TreeNode* node1,TreeNode* node2){
+          if(node1==0&&node2==0) return true;
+          if(node1==0||node2==0) return false;
+          if(node1->val!=node2->val) return false;
+          else 
+            return CompareNodes(node1->left,node2->right)&&CompareNodes(node1->right,node2->left);
+          }
+     };
