6 problems solved.

lintcoder · lintcoder · commit 091b974efaec · 2022-12-03T15:08:22.000+08:00
diff --git a/src/2437.cpp b/src/2437.cpp
@@ -0,0 +1,39 @@
+int countTime(string time) {
+        int sum = 0;
+        if (time[0] == '?')
+        {
+            if (time[1] == '?')
+                sum = 24;
+            else if (time[1] < '4')
+                sum = 3;
+            else
+                sum = 2;
+        }
+        else
+        {
+            if (time[1] == '?')
+            {
+                if (time[0] != '2')
+                    sum = 10;
+                else
+                    sum = 4;
+            }
+            else
+                sum = 1;
+        }
+        
+        if (time[3] == '?')
+        {
+            if (time[4] == '?')
+                sum *= 60;
+            else
+                sum *= 6;
+        }
+        else
+        {
+            if (time[4] == '?')
+                sum *= 10;
+        }
+        
+        return sum;
+    }
diff --git a/src/2475.cpp b/src/2475.cpp
@@ -0,0 +1,18 @@
+int unequalTriplets(vector<int>& nums) {
+        int len = nums.size();
+        int ct = 0;
+        
+        for (int i = 0; i < len-2; ++i)
+        {
+            for (int j = i+1; j < len-1; ++j)
+            {
+                for (int k = j+1; k < len; ++k)
+                {
+                    if (nums[i] != nums[j] && nums[i] != nums[k] && nums[j] != nums[k])
+                        ++ct;
+                }
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/2482.cpp b/src/2482.cpp
@@ -0,0 +1,34 @@
+vector<vector<int>> onesMinusZeros(vector<vector<int>>& grid) {
+        int m = grid.size();
+        int n = grid[0].size();
+        
+        vector<int> onesRow(m, 0);
+        vector<int> zerosRow(m, 0);
+        vector<int> onesCol(n, 0);
+        vector<int> zerosCol(n, 0);
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (grid[i][j] == 1)
+                {
+                    onesRow[i]++;
+                    onesCol[j]++;
+                }
+                else
+                {
+                    zerosRow[i]++;
+                    zerosCol[j]++;
+                }
+            }
+        }
+        
+        vector<vector<int>> diff(m, vector<int>(n, 0));
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+                diff[i][j] = onesRow[i] + onesCol[j] - zerosRow[i] - zerosCol[j];
+        }
+        
+        return diff;
+    }
diff --git a/src/2483.cpp b/src/2483.cpp
@@ -0,0 +1,27 @@
+int bestClosingTime(string customers) {
+        int len = customers.size();
+        
+        int minpenalty = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (customers[i] != 'N')
+                ++minpenalty;
+        }
+        
+        int penalty = minpenalty;
+        int h = len;
+        for (int i = len-1; i >= 0; --i)
+        {
+            if (customers[i] == 'Y')
+                ++penalty;
+            else
+                --penalty;
+            if (penalty <= minpenalty)
+            {
+                minpenalty = penalty;
+                h = i;
+            }
+        }
+        
+        return h;
+    }
diff --git a/src/2485.cpp b/src/2485.cpp
@@ -0,0 +1,8 @@
+int pivotInteger(int n) {
+        int sum = (n*n+n)/2;
+        int lim = sqrt(sum);
+        if (lim*lim == sum)
+            return lim;
+        else
+            return -1;
+    }
diff --git a/src/2486.cpp b/src/2486.cpp
@@ -0,0 +1,21 @@
+int appendCharacters(string s, string t) {
+        int len1 = s.size();
+        int len2 = t.size();
+        
+        int i = 0, j = 0;
+        while (i < len1 && j < len2)
+        {
+            if (s[i] == t[j])
+            {
+                ++i;
+                ++j;
+            }
+            else
+                ++i;
+        }
+        
+        if (j == len2)
+            return 0;
+        else
+            return len2-j;
+    }
