5 problems solved.

lintcoder · lintcoder · commit 105d7d8273f0 · 2022-04-23T21:14:43.000+08:00
diff --git a/src/1051.cpp b/src/1051.cpp
@@ -0,0 +1,14 @@
+int heightChecker(vector<int>& heights) {
+        int len = heights.size();
+        vector<int> ori(heights);
+        sort(heights.begin(), heights.end());
+        
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (ori[i] != heights[i])
+                ++ct;
+        }
+        
+        return ct;
+    }
diff --git a/src/2149.cpp b/src/2149.cpp
@@ -0,0 +1,20 @@
+vector<int> rearrangeArray(vector<int>& nums) {
+        int len = nums.size();
+        vector<int> res(len, 0);
+        int even = 0, odd = 1;
+        for (int i = 0; i < len; ++i)
+        {
+            if (nums[i] > 0)
+            {
+                res[even] = nums[i];
+                even += 2;
+            }
+            else
+            {
+                res[odd] = nums[i];
+                odd += 2;
+            }
+        }
+        
+        return res;
+    }
diff --git a/src/2239.cpp b/src/2239.cpp
@@ -0,0 +1,21 @@
+int findClosestNumber(vector<int>& nums) {
+        int mindist = 1e5;
+        int val = -1e5;
+        int len = nums.size();
+        for (int i = 0; i < len; ++i)
+        {
+            int tmp = abs(nums[i]);
+            if (tmp < mindist)
+            {
+                mindist = tmp;
+                val = nums[i];
+            }
+            else if (tmp == mindist)
+            {
+                if (nums[i] > val)
+                    val = nums[i];
+            }
+        }
+        
+        return val;
+    }
diff --git a/src/2243.cpp b/src/2243.cpp
@@ -0,0 +1,51 @@
+string digitSum(string s, int k) {
+        int len = s.size();
+        while (len > k)
+        {
+            int n = len/k;
+            int j = 0, sum = 0, m = 0;
+            for (int i = 0; i < n; ++i)
+            {
+                sum = 0;
+                for (j = i*k; j < (i+1)*k; ++j)
+                {
+                    sum += s[j]-'0';
+                }
+
+                int lim = sum > 0 ? log10(sum) : 0;
+                int idx = m+lim;
+                int tmp = idx;
+                while (lim >= 0)
+                {
+                    s[idx--] = sum%10+'0';
+                    sum /= 10;
+                    --lim;
+                }
+                m = tmp+1;
+            }
+            
+            if (j < len)
+            {
+                sum = 0;
+                for (int i = j; i < len; ++i)
+                {
+                    sum += s[i]-'0';
+                }
+                int lim = sum > 0 ? log10(sum) : 0;
+                int idx = m+lim;
+                int tmp = idx;
+                while (lim >= 0)
+                {
+                    s[idx--] = sum%10+'0';
+                    sum /= 10;
+                    --lim;
+                }
+                m = tmp+1;
+                len = m;
+            }
+            else
+                len = m;
+        }
+        
+        return s.substr(0,len);
+    }
diff --git a/src/883.cpp b/src/883.cpp
@@ -0,0 +1,22 @@
+int projectionArea(vector<vector<int>>& grid) {
+        int n = grid.size();
+        int area = 0;
+        for (int i = 0; i < n; ++i)
+        {
+            int maxvalrow = 0;
+            int maxvalcol = 0;
+            for (int j = 0; j < n; ++j)
+            {
+                if (grid[i][j] > 0)
+                    area++;
+                if (grid[i][j] > maxvalrow)
+                    maxvalrow = grid[i][j];
+                if (grid[j][i] > maxvalcol)
+                    maxvalcol = grid[j][i];
+            }
+            
+            area += maxvalrow + maxvalcol;
+        }
+        
+        return area;
+    }
