6 problems solved.

lintcoder · lintcoder · commit 7954d523f534 · 2022-04-16T15:37:17.000+08:00
diff --git a/src/2165.cpp b/src/2165.cpp
@@ -0,0 +1,34 @@
+long long smallestNumber(long long num) {
+        if (num == 0)
+            return 0;
+        else if (num < 0)
+        {
+            num = -num;
+            string s = to_string(num);
+            sort(s.begin(), s.end(), greater<char>());
+            return -1*stoll(s, nullptr);
+        }
+        else
+        {
+            string s = to_string(num);
+            sort(s.begin(), s.end());
+            int len = s.size();
+            int i = 0;
+            for (i = 0; i < len; ++i)
+            {
+                if(s[i] != '0')
+                    break;
+            }
+            if (i != len)
+            {
+                char c = s[i];
+                for (; i >= 1; --i)
+                {
+                    s[i] = s[i-1];
+                }
+                s[0] = c;
+            }
+
+            return stoll(s, nullptr);
+        }
+    }
diff --git a/src/2186.cpp b/src/2186.cpp
@@ -0,0 +1,15 @@
+int minSteps(string s, string t) {
+        int num1[26] = {0};
+        int num2[26] = {0};
+        int len1 = s.size(), len2 = t.size();
+        for (int i = 0; i < len1; ++i)
+            num1[s[i]-'a']++;
+        for (int i = 0; i < len2; ++i)
+            num2[t[i]-'a']++;
+        
+        int ct = 0;
+        for (int i = 0; i < 26; ++i)
+            ct += abs(num1[i]-num2[i]);
+        
+        return ct;
+    }
diff --git a/src/2201.cpp b/src/2201.cpp
@@ -0,0 +1,28 @@
+int digArtifacts(int n, vector<vector<int>>& artifacts, vector<vector<int>>& dig) {
+        map<pair<int,int>,int> mp;
+        int len = artifacts.size();
+        for (int i = 0; i < len; ++i)
+        {
+            int r1 = artifacts[i][0], c1 = artifacts[i][1];
+            int r2 = artifacts[i][2], c2 = artifacts[i][3];
+            for (int j = r1; j <= r2; ++j)
+            {
+                for (int k = c1; k <= c2; ++k)
+                    mp[make_pair(j,k)] = i+1;
+            }
+        }
+        
+        int sz = dig.size();
+        for (int i = 0; i < sz; ++i)
+            mp[make_pair(dig[i][0], dig[i][1])] = 0;
+        
+        set<int> st;
+        auto iterLast = mp.end();
+        for (auto iter = mp.begin(); iter != iterLast; ++iter)
+        {
+            if (iter->second != 0)
+                st.insert(iter->second);
+        }
+        
+        return len - st.size();
+    }
diff --git a/src/2232.cpp b/src/2232.cpp
@@ -0,0 +1,56 @@
+string minimizeResult(string expression) {
+        int num1 = 0, num2 = 0;
+        int len = expression.size();
+        int index = expression.find('+');
+        int m = len-1-index;
+        for (int i = 0; i < index; ++i)
+            num1 = num1*10 + (expression[i]-'0');
+        for (int i = index+1; i < len; ++i)
+            num2 = num2*10 + (expression[i]-'0');
+        
+        int digit1[20] = {1,num1}, digit2[20] = {num2,1};
+        int n = pow(10, index-1);
+        for (int i = 1; i < index; ++i)
+        {
+            digit1[i*2] = num1/n;
+            digit1[i*2+1] = num1%n;
+            n /= 10;
+        }
+        n = 10;
+        for (int i = 1; i < m; ++i)
+        {
+            digit2[i*2] = num2/n;
+            digit2[i*2+1] = num2%n;
+            n *= 10;
+        }
+        
+        int minval = 1e9;
+        int p = 0, q = 0;
+        for (int i = 0; i < index; ++i)
+        {
+            for (int j = 0; j < m; ++j)
+            {
+                int val = digit1[i*2]*(digit1[i*2+1] + digit2[j*2])*digit2[j*2+1];
+                if (val < minval)
+                {
+                    minval = val;
+                    p = i;
+                    q = j;
+                }
+            }
+        }
+
+        string res(len+2, ' ');
+        int k = 0;
+        for (int i = 0; i < len+2; ++i)
+        {
+            if (i == p)
+                res[i] = '(';
+            else if (i == len+1-q)
+                res[i] = ')';
+            else
+                res[i] = expression[k++];
+        }
+        
+        return res;
+    }
diff --git a/src/2235.cpp b/src/2235.cpp
@@ -0,0 +1,3 @@
+int sum(int num1, int num2) {
+        return num1 + num2;
+    }
diff --git a/src/2236.cpp b/src/2236.cpp
@@ -0,0 +1,3 @@
+bool checkTree(TreeNode* root) {
+        return root->val == root->left->val + root->right->val;
+    }

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+int sum(int num1, int num2) {`
	`2`	`+ return num1 + num2;`
	`3`	`+ }`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+bool checkTree(TreeNode* root) {`
	`2`	`+ return root->val == root->left->val + root->right->val;`
	`3`	`+ }`