6 problems solved.

lintcoder · lintcoder · commit 8711b584ae84 · 2020-05-23T12:46:32.000+08:00
diff --git a/src/1431.cpp b/src/1431.cpp
@@ -0,0 +1,18 @@
+vector<bool> kidsWithCandies(vector<int>& candies, int extraCandies) {
+        int len = candies.size();
+        int maxmum = candies[0];
+        for (int i = 1; i < len; ++i)
+        {
+            if (candies[i] > maxmum)
+                maxmum = candies[i];
+        }
+        
+        vector<bool> res(len);
+        for (int i = 0; i < len; ++i)
+        {
+            if (candies[i]+extraCandies >= maxmum)
+                res[i] = true;
+        }
+        
+        return res;
+    }
diff --git a/src/1436.cpp b/src/1436.cpp
@@ -0,0 +1,21 @@
+string destCity(vector<vector<string>>& paths) {
+        map<string, int> mp;
+        int len = paths.size();
+        for (int i = 0; i < len; ++i)
+        {
+            if (mp.find(paths[i][0]) == mp.end())
+                mp[paths[i][0]] = -1;
+            else
+                mp[paths[i][0]] = 0;
+            if (mp.find(paths[i][1]) == mp.end())
+                mp[paths[i][1]] = 1;
+            else
+                mp[paths[i][1]] = 0;
+        }
+        
+        for (auto iter = mp.begin(); iter != mp.end(); ++iter)
+            if (iter->second == 1)
+                return iter->first;
+        
+        return "";
+    }
diff --git a/src/1441.cpp b/src/1441.cpp
@@ -0,0 +1,26 @@
+vector<string> buildArray(vector<int>& target, int n) {
+        vector<string> res(n*2);
+        int len = target.size();
+        int last = 0;
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int tmp = target[i]-last-1;
+            if (tmp == 0)
+                res[ct++] = "Push";
+            else
+            {
+                for (int j = 0; j < tmp; ++j)
+                {
+                    res[ct] = "Push";
+                    res[ct+1] = "Pop";
+                    ct += 2;
+                }
+                res[ct++] = "Push";
+            }
+            last = target[i];
+        }
+        
+        res.resize(ct);
+        return res;
+    }
diff --git a/src/1446.cpp b/src/1446.cpp
@@ -0,0 +1,26 @@
+int maxPower(string s) {
+        int len = s.size();
+        int maxmum = 1;
+        
+        char c = s[0];
+        int i = 1, ct = 1;
+        while (i < len)
+        {
+            if (s[i] == c)
+                ++ct;
+            else
+            {
+                if (ct > maxmum)
+                    maxmum = ct;
+                ct = 1;
+                c = s[i];
+            }
+            
+            ++i;
+        }
+        
+        if (ct > maxmum)
+            maxmum = ct;
+        
+        return maxmum;
+    }
diff --git a/src/1448.cpp b/src/1448.cpp
@@ -0,0 +1,26 @@
+int goodNodes(TreeNode* root) {
+        if (root == nullptr)
+            return 0;
+        int ct = 1;
+        int maxmum = root->val;
+        
+        if (root->left != nullptr)
+            search(root->left, maxmum, ct);
+        if (root->right != nullptr)
+            search(root->right, maxmum, ct);
+        
+        return ct;
+    }
+    
+    void search(TreeNode* node, int maxmum, int& ct)
+    {
+        if (node->val >= maxmum)
+        {
+            ++ct;
+            maxmum = node->val;
+        }
+        if (node->left != nullptr)
+            search(node->left, maxmum, ct);
+        if (node->right != nullptr)
+            search(node->right, maxmum, ct);
+    }
diff --git a/src/1450.cpp b/src/1450.cpp
@@ -0,0 +1,11 @@
+int busyStudent(vector<int>& startTime, vector<int>& endTime, int queryTime) {
+        int len = startTime.size();
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (queryTime >= startTime[i] && queryTime <= endTime[i])
+                ++ct;
+        }
+        
+        return ct;
+    }
