5 problems solved.

lintcoder · lintcoder · commit 408c730cacb5 · 2020-01-01T19:06:54.000+08:00
diff --git a/src/1237.cpp b/src/1237.cpp
@@ -0,0 +1,25 @@
+vector<vector<int>> findSolution(CustomFunction& customfunction, int z) {
+        vector<vector<int>> res;
+        int limity = 1000;
+        for (int i = 1; i <= 1000; ++i)
+        {
+            int p = 1, q = limity;
+            while (p <= q)
+            {
+                int mid = (p+q)/2;
+                int tmp = customfunction.f(i, mid);
+                if (tmp == z)
+                {
+                    res.push_back({i, mid});
+                    limity = mid;
+                    break;
+                }    
+                else if (tmp < z)
+                    p = mid+1;
+                else
+                    q = mid-1;
+            }
+        }
+        
+        return res;
+    }
diff --git a/src/1298.cpp b/src/1298.cpp
@@ -0,0 +1,33 @@
+int maxCandies(vector<int>& status, vector<int>& candies, vector<vector<int>>& keys, vector<vector<int>>& containedBoxes, vector<int>& initialBoxes) {
+        int sum = 0;
+        int len = status.size();
+        vector<int> flag(len, 0);
+        
+        deque<int> dq(initialBoxes.begin(), initialBoxes.end());
+        int sz = dq.size();
+        while (sz > 0)
+        {
+            int i = 0;
+            for (i = 0; i < sz; ++i)
+                if (status[dq[i]] == 1 && flag[dq[i]] == 0)
+                    break;
+            if (i == sz)
+                break;
+            
+            int n = dq[i];
+            dq.erase(dq.begin()+i);
+            
+            flag[n] = 1;
+            sum += candies[n];
+            
+            int l = keys[n].size();
+            for (int j = 0; j < l; ++j)
+                status[keys[n][j]] = 1;
+            l = containedBoxes[n].size();
+            for (int j = 0; j < l; ++j)
+                dq.push_back(containedBoxes[n][j]);
+            sz = dq.size();
+        }
+        
+        return sum;
+    }
diff --git a/src/1304.cpp b/src/1304.cpp
@@ -0,0 +1,22 @@
+vector<int> sumZero(int n) {
+        vector<int> res(n, 0);
+        if (n%2 == 0)
+        {
+            for (int i = 0; i < n/2; ++i)
+            {
+                res[i] = i+1;
+                res[n-1-i] = -(i+1);
+            }    
+        }
+        else
+        {
+            res[n/2] = 0;
+            for (int i = 0; i < n/2; ++i)
+            {
+                res[i] = i+1;
+                res[n-1-i] = -(i+1);
+            }
+        }
+        
+        return res;
+    }
diff --git a/src/1305.cpp b/src/1305.cpp
@@ -0,0 +1,19 @@
+vector<int> getAllElements(TreeNode* root1, TreeNode* root2) {
+        vector<int> res;
+        midtravel(root1, res);
+        midtravel(root2, res);
+        
+        sort(res.begin(), res.end());
+        
+        return move(res);
+    }
+    
+    void midtravel(TreeNode* node, vector<int>& vec)
+    {
+        if (node != nullptr)
+        {
+            midtravel(node->left, vec);
+            vec.push_back(node->val);
+            midtravel(node->right, vec);
+        }
+    }
diff --git a/src/965.cpp b/src/965.cpp
@@ -0,0 +1,14 @@
+bool isUnivalTree(TreeNode* root) {
+        if (root == nullptr)
+            return true;
+        return isUnivalSubTree(root->left, root->val) && isUnivalSubTree(root->right, root->val);
+    }
+    
+    bool isUnivalSubTree(TreeNode* node, int key)
+    {
+        if (node == nullptr)
+            return true;
+        if (node->val != key)
+            return false;
+        return isUnivalSubTree(node->left, key) && isUnivalSubTree(node->right, key);
+    }
