5 problems solved.

lintcoder · lintcoder · commit 22c0111fec83 · 2022-01-21T21:34:23.000+08:00
diff --git a/src/1252.cpp b/src/1252.cpp
@@ -0,0 +1,24 @@
+int oddCells(int m, int n, vector<vector<int>>& indices) {
+        vector<vector<int>> vec(m, vector<int>(n, 0));
+        int len = indices.size();
+        for (int i = 0; i < len; ++i)
+        {
+            int row = indices[i][0], col = indices[i][1];
+            for (int r = 0; r < m; ++r)
+                vec[r][col]++;
+            for (int c = 0; c < n; ++c)
+                vec[row][c]++;
+        }
+        
+        int ct = 0;
+        for (int i = 0; i < m; ++i)
+        {
+            for (int j = 0; j < n; ++j)
+            {
+                if (vec[i][j]%2 == 1)
+                    ++ct;
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/1725.cpp b/src/1725.cpp
@@ -0,0 +1,18 @@
+int countGoodRectangles(vector<vector<int>>& rectangles) {
+        int len = rectangles.size();
+        int n = 0;
+        int maxlen = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int k = rectangles[i][0] < rectangles[i][1] ? rectangles[i][0] : rectangles[i][1];
+            if (k > maxlen)
+            {
+                maxlen = k;
+                n = 1;
+            }
+            else if (k == maxlen)
+                ++n;
+        }
+        
+        return n;
+    }
diff --git a/src/2138.cpp b/src/2138.cpp
@@ -0,0 +1,30 @@
+vector<string> divideString(string s, int k, char fill) {
+        int len = s.size();
+        int n = (len+k-1)/k;
+        int total = n*k;
+        vector<string> res(n, string(k, ' '));
+        int i = 0, j = 0, m = -1;
+        while (i < len)
+        {
+            if (i%k == 0)
+            {
+                ++m;
+                j = 0;
+                res[m][j] = s[i];
+            }
+            else
+            {
+                res[m][j] = s[i];
+            }
+            ++i;
+            ++j;
+        }
+        
+        while (i < total)
+        {
+            res[m][j++] = fill;
+            ++i;
+        }
+        
+        return res;
+    }
diff --git a/src/495.cpp b/src/495.cpp
@@ -0,0 +1,24 @@
+int findPoisonedDuration(vector<int>& timeSeries, int duration) {
+        int len = timeSeries.size();
+        int time = 0;
+        int bg = timeSeries[0], ed = timeSeries[0]+duration-1;
+        int i = 1;
+        while (i < len)
+        {
+            if (timeSeries[i] > ed)
+            {
+                time += ed-bg+1;
+                bg = timeSeries[i];
+                ed = timeSeries[i]+duration-1;
+            }
+            else
+            {
+                ed = timeSeries[i]+duration-1;
+            }
+            ++i;
+        }
+        
+        time += ed-bg+1;
+        
+        return time;
+    }
diff --git a/src/74.cpp b/src/74.cpp
@@ -0,0 +1,19 @@
+bool searchMatrix(vector<vector<int>>& matrix, int target) {
+        int m = matrix.size();
+        int n = matrix[0].size();
+        
+        int p = 0, q = m*n-1;
+        while (p <= q)
+        {
+            int mid = (p+q)/2;
+            int r = mid/n, c = mid%n;
+            if (matrix[r][c] == target)
+                return true;
+            else if (matrix[r][c] < target)
+                p = mid+1;
+            else
+                q = mid-1;
+        }
+        
+        return false;
+    }
