8 problems solved.

lintcoder · lintcoder · commit a5ccc9a274d4 · 2021-03-25T12:26:41.000+08:00
diff --git a/src/1013.cpp b/src/1013.cpp
@@ -0,0 +1,35 @@
+bool canThreePartsEqualSum(vector<int>& A) {
+        int len = A.size();
+        int sum = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            sum += A[i];
+        }
+        if (sum%3 != 0)
+            return false;
+        
+        int i = 0;
+        int subsum = 0;
+        while (i <len-2)
+        {
+            subsum += A[i];
+            if (subsum == sum/3)
+                break;
+            ++i;
+        }
+        
+        if (i == len-2)
+            return false;
+        ++i;
+        
+        subsum = 0;
+        while (i < len-1)
+        {
+            subsum += A[i];
+            if (subsum == sum/3)
+                break;
+            ++i;
+        }
+        
+        return i < len-1;
+    }
diff --git a/src/1476.cpp b/src/1476.cpp
@@ -0,0 +1,24 @@
+class SubrectangleQueries {
+public:
+    SubrectangleQueries(vector<vector<int>>& rectangle) {
+        data.assign(rectangle.begin(), rectangle.end());
+        row = rectangle.size();
+        col = rectangle[0].size();
+    }
+    
+    void updateSubrectangle(int row1, int col1, int row2, int col2, int newValue) {
+        for (int i = row1; i <= row2; ++i)
+        {
+            fill(data[i].begin()+col1, data[i].begin()+col2+1, newValue);
+        }
+    }
+    
+    int getValue(int row, int col) {
+        return data[row][col];
+    }
+    
+    private:
+    vector<vector<int>> data;
+    int row;
+    int col;
+};
diff --git a/src/1539.cpp b/src/1539.cpp
@@ -0,0 +1,22 @@
+int findKthPositive(vector<int>& arr, int k) {
+        int flag[2000] = {0};
+        int len = arr.size();
+        for (int i = 0; i < len; ++i)
+            flag[arr[i]-1] = 1;
+        
+        int ct = 0;
+        for (int i = 0; i < 2000; ++i)
+        {
+            if (flag[i] == 0)
+            {
+                ++ct;
+                if (ct == k)
+                {
+                    ct = i+1;
+                    break;
+                }
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/1582.cpp b/src/1582.cpp
@@ -0,0 +1,28 @@
+int numSpecial(vector<vector<int>>& mat) {
+        int row = mat.size();
+        int col = mat[0].size();
+        map<int, int> rowmp, colmp;
+        for (int i = 0; i < row; ++i)
+        {
+            for (int j = 0; j < col; ++j)
+            {
+                if (mat[i][j] == 1)
+                {
+                    rowmp[i]++;
+                    colmp[j]++;
+                }
+            }
+        }
+
+        int ct = 0;
+        for (int i = 0; i < row; ++i)
+        {
+            for (int j = 0; j < col; ++j)
+            {
+                if (mat[i][j] == 1 && rowmp[i] == 1 && colmp[j] == 1)
+                    ++ct;
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/1700.cpp b/src/1700.cpp
@@ -0,0 +1,21 @@
+int countStudents(vector<int>& students, vector<int>& sandwiches) {
+        deque<int> stu(students.begin(), students.end());
+        
+        int len = sandwiches.size();
+        int remain = len;
+        int i = 0, j = 0;
+        while (i < len)
+        {
+            for (j = 0; j < remain; ++j)
+                if (sandwiches[i] == stu[j])
+                    break;
+            if (j == remain)
+                break;
+            stu.insert(stu.end(), stu.begin(), stu.begin()+j);
+            stu.erase(stu.begin(), stu.begin()+j+1);
+            ++i;
+            --remain;
+        }
+        
+        return remain;
+    }
diff --git a/src/1769.cpp b/src/1769.cpp
@@ -0,0 +1,17 @@
+vector<int> minOperations(string boxes) {
+        int len = boxes.size();
+        vector<int> res(len, 0);
+        
+        for (int i = 0; i < len; ++i)
+        {
+            int ct = 0;
+            for (int j = 0; j < len; ++j)
+            {
+                if (boxes[j] == '1')
+                    ct += abs(j-i);
+            }
+            res[i] = ct;
+        }
+        
+        return res;
+    }
diff --git a/src/1779.cpp b/src/1779.cpp
@@ -0,0 +1,22 @@
+int nearestValidPoint(int x, int y, vector<vector<int>>& points) {
+        int len = points.size();
+        int minv = numeric_limits<int>::max();
+        int pos = -1;
+        
+        for (int i = 0; i < len; ++i)
+        {
+            if (points[i][0] == x || points[i][1] == y)
+            {
+                int dist = abs(x-points[i][0]) + abs(y-points[i][1]);
+                if (dist == 0)
+                    return i;
+                else if (dist < minv)
+                {
+                    minv = dist;
+                    pos = i;
+                }
+            }
+        }
+        
+        return pos;
+    }
diff --git a/src/1790.cpp b/src/1790.cpp
@@ -0,0 +1,26 @@
+bool areAlmostEqual(string s1, string s2) {
+        if (s1 == s2)
+            return true;
+        int len = s1.size();
+        int ct = 0;
+        char arr[4];
+        for (int i = 0; i < len; ++i)
+        {
+            if (s1[i] != s2[i])
+            {
+                if (ct == 2)
+                    return false;
+                arr[ct*2] = s1[i];
+                arr[ct*2+1] = s2[i];
+                ++ct;
+            }
+        }
+        
+        if (ct == 1)
+            return false;
+        
+        if (arr[0] == arr[3] && arr[1] == arr[2])
+            return true;
+        else
+            return false;
+    }
