9 problems solved.

lintcoder · lintcoder · commit 3f73ee1ce6ef · 2022-07-10T13:20:43.000+08:00
diff --git a/src/2283.cpp b/src/2283.cpp
@@ -0,0 +1,17 @@
+bool digitCount(string num) {
+        int arr[10] = {0};
+        int len = num.size();
+        
+        for (int i = 0; i < len; ++i)
+        {
+            arr[num[i]-'0']++;
+        }
+        
+        for (int i = 0; i < len; ++i)
+        {
+            if (arr[i] != num[i]-'0')
+                return false;
+        }
+        
+        return true;
+    }
diff --git a/src/2293.cpp b/src/2293.cpp
@@ -0,0 +1,17 @@
+int minMaxGame(vector<int>& nums) {
+        int len = nums.size();
+        while (len != 1)
+        {
+            int n = len/2;
+            for (int i = 0; i < n; ++i)
+            {
+                if (i%2 == 0)
+                    nums[i] = min(nums[i*2], nums[i*2+1]);
+                else
+                    nums[i] = max(nums[i*2], nums[i*2+1]);
+            }
+            len /= 2;
+        }
+        
+        return nums[0];
+    }
diff --git a/src/2299.cpp b/src/2299.cpp
@@ -0,0 +1,27 @@
+bool strongPasswordCheckerII(string password) {
+        string special = "!@#$%^&*()-+";
+        int len = password.size();
+        if (len < 8)
+            return false;
+        int lowernum = 0, uppernum = 0, digitnum = 0, specialnum = 0;
+        char last = password[0];
+        for (int i = 0; i < len; ++i)
+        {
+            if (password[i] >= 'a' && password[i] <='z')
+                ++lowernum;
+            else if (password[i] >= 'A' && password[i] <= 'Z')
+                ++uppernum;
+            else if (password[i] >= '0' && password[i] <= '9')
+                ++digitnum;
+            else if (special.find(password[i]) != string::npos)
+                ++specialnum;
+            if (i >= 1)
+            {
+                if (password[i] == last)
+                    return false;
+                last = password[i];
+            }
+        }
+        
+        return lowernum >= 1 && uppernum >= 1 && digitnum >= 1 && specialnum >= 1;
+    }
diff --git a/src/2303.cpp b/src/2303.cpp
@@ -0,0 +1,19 @@
+double calculateTax(vector<vector<int>>& brackets, int income) {
+        int len = brackets.size();
+        double taxes = 0;
+        int last = 0;
+        
+        for (int i = 0; i < len; ++i)
+        {
+            int num = brackets[i][0]-last;
+            double val = num < income ? num : income;
+            taxes += val*brackets[i][1]/100;
+            
+            if (income <= num)
+                break;
+            income -= num;
+            last = brackets[i][0];
+        }
+        
+        return taxes;
+    }
diff --git a/src/2309.cpp b/src/2309.cpp
@@ -0,0 +1,19 @@
+string greatestLetter(string s) {
+        char digitnum[52] = {0};
+        int len = s.size();
+        
+        for (int i = 0; i < len; ++i)
+        {
+            if (s[i] >= 'a' && s[i] <= 'z')
+                digitnum[s[i]-'a'] = 1;
+            else
+                digitnum[s[i]-'A'+26] = 1;
+        }
+        for (int i = 25; i >= 0; --i)
+        {
+            if (digitnum[i] == 1 && digitnum[i+26] == 1)
+                return string(1,'A'+i);
+        }
+        
+        return "";
+    }
diff --git a/src/2315.cpp b/src/2315.cpp
@@ -0,0 +1,26 @@
+int countAsterisks(string s) {
+        int len = s.size();
+        int i = 0;
+        int ct = 0;
+        bool flag = false;
+        
+        while (i < len)
+        {
+            if (flag == false)
+            {
+                if (s[i] == '*')
+                    ++ct;
+                else if (s[i] == '|')
+                    flag = true;
+                ++i;
+            }
+            else
+            {
+                if (s[i] == '|')
+                    flag = false;
+                ++i;
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/2319.cpp b/src/2319.cpp
@@ -0,0 +1,21 @@
+bool checkXMatrix(vector<vector<int>>& grid) {
+        int n = grid.size();
+        for (int i = 0; i < n; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if(i == j || i+j == n-1)
+                {
+                    if(grid[i][j] == 0)
+                        return false;
+                }
+                else
+                {
+                    if(grid[i][j] != 0)
+                        return false;
+                }
+            }
+        }
+        
+        return true;
+    }
diff --git a/src/2325.cpp b/src/2325.cpp
@@ -0,0 +1,27 @@
+string decodeMessage(string key, string message) {
+        array<char, 26> transTb{};
+        array<bool, 26> flag{};
+        
+        int len = key.size();
+        int j = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if(key[i] != ' ' && flag[key[i]-'a'] == false)
+            {
+                transTb[key[i]-'a'] = 'a'+j;
+                flag[key[i]-'a'] = true;
+                ++j;
+                if(j == 26)
+                    break;
+            }
+        }
+        
+        int mlen = message.size();
+        for (int i = 0; i < mlen; ++i)
+        {
+            if(message[i] != ' ')
+                message[i] = transTb[message[i]-'a'];
+        }
+        
+        return move(message);
+    }
diff --git a/src/2331.cpp b/src/2331.cpp
@@ -0,0 +1,10 @@
+bool evaluateTree(TreeNode* root) {
+        if (root->val == 0)
+            return false;
+        else if (root->val == 1)
+            return true;
+        else if (root->val == 2)
+            return evaluateTree(root->left) || evaluateTree(root->right);
+        else
+            return evaluateTree(root->left) && evaluateTree(root->right);
+    }
