5 problems solved.

lintcoder · lintcoder · commit 0078ac6c2d25 · 2021-03-06T19:46:01.000+08:00
diff --git a/src/1315.cpp b/src/1315.cpp
@@ -0,0 +1,37 @@
+int sumEvenGrandparent(TreeNode* root) {
+        return search(root);
+    }
+    
+    int search(TreeNode* node)
+    {
+        if (node == nullptr)
+            return 0;
+        else if (node->val % 2 == 1)
+            return search(node->left) + search(node->right);
+        else
+        {
+            int sum = 0;
+            TreeNode* l1 = node->left;
+            TreeNode* l2 = node->right;
+            if (l1 != nullptr)
+            {
+                TreeNode* ll1 = l1->left;
+                TreeNode* ll2 = l1->right;
+                if (ll1 != nullptr)
+                    sum += ll1->val;
+                if (ll2 != nullptr)
+                    sum += ll2->val;
+            }
+            if (l2 != nullptr)
+            {
+                TreeNode* lr1 = l2->left;
+                TreeNode* lr2 = l2->right;
+                if (lr1 != nullptr)
+                    sum += lr1->val;
+                if (lr2 != nullptr)
+                    sum += lr2->val;
+            }
+            
+            return sum + search(l1) + search(l2);
+        }
+    }
diff --git a/src/1523.cpp b/src/1523.cpp
@@ -0,0 +1,6 @@
+int countOdds(int low, int high) {
+        if (low%2 == 1 && high%2 == 1)
+            return (high-low)/2 + 1;
+        else
+            return (high-low+1)/2;
+    }
diff --git a/src/1544.cpp b/src/1544.cpp
@@ -0,0 +1,27 @@
+string makeGood(string s) {
+        int len = s.size();
+        string res(len, ' ');
+        int i = 0, j = 0;
+        res[j] = s[i];
+        ++i;
+        ++j;
+        while (i < len)
+        {
+            if (j == 0)
+            {
+                res[j++] = s[i++];
+            }
+            else if ((islower(res[j-1]) && isupper(s[i]) && res[j-1] == tolower(s[i]))
+                || (isupper(res[j-1]) && islower(s[i]) && res[j-1] == toupper(s[i])))
+            {
+                --j;
+                ++i;
+            }
+            else
+            {
+                res[j++] = s[i++];
+            }      
+        }
+        
+        return res.substr(0, j);
+    }
diff --git a/src/1640.cpp b/src/1640.cpp
@@ -0,0 +1,39 @@
+bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) {
+        int len = arr.size();
+        struct Elem
+        {
+            int pos;
+            int length;
+            Elem(int p = -1, int l = 0): pos(p), length(l){}
+        };
+        
+        int n = pieces.size();
+        map<int, Elem> mp;
+        int sum = 0;
+        for (int i = 0; i < n; ++i)
+        {
+            int m = pieces[i].size();
+            mp.insert(make_pair(pieces[i][0], Elem(i, m)));
+            sum += m;
+        }
+        
+        if (len != sum)
+            return false;
+        
+        int i = 0;
+        while (i < len)
+        {
+            auto iter = mp.find(arr[i]);
+            if (iter == mp.end())
+                return false;
+            for (int k = 0; k < (iter->second).length; ++k)
+            {
+                if (arr[i] != pieces[(iter->second).pos][k])
+                    return false;
+                else
+                    ++i;
+            }
+        }
+        
+        return true;
+    }
diff --git a/src/1773.cpp b/src/1773.cpp
@@ -0,0 +1,19 @@
+int countMatches(vector<vector<string>>& items, string ruleKey, string ruleValue) {
+        int len = items.size();
+        int pos = -1;
+        if (ruleKey == "type")
+            pos = 0;
+        else if (ruleKey == "color")
+            pos = 1;
+        else
+            pos = 2;
+        
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (items[i][pos] == ruleValue)
+                ++ct;
+        }
+        
+        return ct;
+    }
