leetcode

Author: Pankajcoder1

LeetCode/2536. Increment Submatrices by One.cpp.cpp

@@ -2,39 +2,39 @@
     written by Pankaj Kumar.
     country:-INDIA
 */
-typedef long long ll ;
-const ll INF=1e18;
-const ll mod1=1e9+7;
-const ll mod2=998244353;
-//Add main code here
+typedef long long ll;
+const ll INF = 1e18;
+const ll mod1 = 1e9 + 7;
+const ll mod2 = 998244353;
+// Add main code here
 
 class Solution
 {
 public:
-    long long minOperations(vector<int> &nums1, vector<int> &nums2, int k)
+    vector<vector<int>> rangeAddQueries(int n, vector<vector<int>> &queries)
     {
-        if(k==0){
-            return nums1==nums2?0:-1;
+        vector<vector<int>> s(n, vector<int>(n, 0));
+        for (auto &q : queries)
+        {
+            ++q[2], ++q[3];
+            s[q[0]][q[1]]++;
+            if (q[2] < n)
+                s[q[2]][q[1]]--;
+            if (q[3] < n)
+                s[q[0]][q[3]]--;
+            if (q[2] < n && q[3] < n)
+                s[q[2]][q[3]]++;
         }
-        long long countPos=0,countNeg=0;
-        for(int i=0;i<nums1.size();i++){
-            long long diff=nums1[i]-nums2[i];
-            if(diff%k){
-                return -1;
+        for (int i = 0; i < n; ++i)
+            for (int j = 0; j < n; ++j)
+            {
+                if (i > 0)
+                    s[i][j] += s[i - 1][j];
+                if (j > 0)
+                    s[i][j] += s[i][j - 1];
+                if (i > 0 && j > 0)
+                    s[i][j] -= s[i - 1][j - 1];
             }
-            else if(diff>0){
-                countPos+=diff/k;
-            }
-            else{
-                countNeg+=diff/k;
-            }
-
-        }
-        if(countPos+countNeg==0){
-            return countPos;
-        }
-        else{
-            return -1;
-        }
+        return s;
     }
 };

LeetCode/6275. Minimum Operations to Make Array Equal II.cpp

@@ -0,0 +1,40 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    long long minOperations(vector<int> &nums1, vector<int> &nums2, int k)
+    {
+        if(k==0){
+            return nums1==nums2?0:-1;
+        }
+        long long countPos=0,countNeg=0;
+        for(int i=0;i<nums1.size();i++){
+            long long diff=nums1[i]-nums2[i];
+            if(diff%k){
+                return -1;
+            }
+            else if(diff>0){
+                countPos+=diff/k;
+            }
+            else{
+                countNeg+=diff/k;
+            }
+
+        }
+        if(countPos+countNeg==0){
+            return countPos;
+        }
+        else{
+            return -1;
+        }
+    }
+};