Merge pull request #76 from russianalfred/master

第一周作业#27

Author: GeekUniversity

123.jpg

@@ -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 Res= INT_MAX;
+    int Pre = 0;
+    int minDiffInBST(TreeNode* root) {
+        if(root->left != NULL)    
+            minDiffInBST(root->left);
+        if(Pre > 0) 
+            Res = min(Res,root->val - Pre);
+        Pre = root->val;
+        if(root->right != NULL) 
+            minDiffInBST(root->right);  
+        return Res;
+    }
+};

Week_01/id_27/123.jpg

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    int arrangeCoins(int n) {
+        int i = 1;
+        while (n >= i) {
+            n -= i;
+            i++;
+        }
+        return i - 1;        
+    }
+};