Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to content

Commit c270ffc

Browse files
fishercoder1534fishercoder1534
committed
add 2536
1 parent d0df179 commit c270ffc

File tree

2 files changed

+28
-6
lines changed

2 files changed

+28
-6
lines changed

‎README.md

Lines changed: 7 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -8,16 +8,17 @@ _If you like this project, please leave me a star._ ★
88

99
| # | Title | Solutions | Video | Difficulty | Tag
1010
|------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
11-
| 2535 |[Difference Between Element Sum and Digit Sum of an Array](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2535.java) || Easy |
12-
| 2530 |[Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2530.java) |[:tv:](https://youtu.be/nsOipmYbRlc)| Medium |
13-
| 2529 |[Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2529.java) |[:tv:](https://youtu.be/4uhvXmOp5Do)| Easy ||
14-
| 2525 |[Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2525.java) |[:tv:](https://youtu.be/dIciftyQXHo)| Easy ||
11+
| 2536 |[Increment Submatrices by One](https://leetcode.com/problems/increment-submatrices-by-one/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2536.java) || Medium |
12+
| 2535 |[Difference Between Element Sum and Digit Sum of an Array](https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2535.java) || Easy |
13+
| 2530 |[Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2530.java) | [:tv:](https://youtu.be/nsOipmYbRlc) | Medium |
14+
| 2529 |[Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2529.java) | [:tv:](https://youtu.be/4uhvXmOp5Do) | Easy ||
15+
| 2525 |[Categorize Box According to Criteria](https://leetcode.com/problems/categorize-box-according-to-criteria/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2525.java) | [:tv:](https://youtu.be/dIciftyQXHo) | Easy ||
1516
| 2520 |[Count the Digits That Divide a Number](https://leetcode.com/problems/count-the-digits-that-divide-a-number/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2520.java) | [:tv:](https://youtu.be/7SHHsS5kPJ8) | Easy ||
1617
| 2515 |[Shortest Distance to Target String in a Circular Array](https://leetcode.com/problems/shortest-distance-to-target-string-in-a-circular-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2515.java) || Easy ||
1718
| 2496 |[Maximum Value of a String in an Array](https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2496.java) || Easy ||
1819
| 2467 |[Convert the Temperature](https://leetcode.com/problems/convert-the-temperature/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2469.java) || Easy ||
1920
| 2455 |[Average Value of Even Numbers That Are Divisible by Three](https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2455.java) || Easy ||
20-
| 2433 |[Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2433.java) |[:tv:](https://youtu.be/idcT-p_DDrI)| Medium ||
21+
| 2433 |[Find The Original Array of Prefix Xor](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2433.java) | [:tv:](https://youtu.be/idcT-p_DDrI) | Medium ||
2122
| 2432 |[The Employee That Worked on the Longest Task](https://leetcode.com/problems/the-employee-that-worked-on-the-longest-task/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2432.java) || Easy ||
2223
| 2427 |[Number of Common Factors](https://leetcode.com/problems/number-of-common-factors/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2427.java) || Easy ||
2324
| 2404 |[Most Frequent Even Element](https://leetcode.com/problems/most-frequent-even-element/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2404.java) || Easy ||
@@ -565,7 +566,7 @@ _If you like this project, please leave me a star._ ★
565566
| 1066 |[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1066.java) | | Medium |Backtracking, DP|
566567
| 1065 |[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java) | | Medium ||
567568
| 1062 |[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java) | | Medium |String, Binary Search, DP, Rolling Hash, Suffix Array, Hash Function|
568-
| 1061 |[Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1061.java) | [:tv:](https://youtu.be/HvCaMw58_94)| Medium |Union Find
569+
| 1061 |[Lexicographically Smallest Equivalent String](https://leetcode.com/problems/lexicographically-smallest-equivalent-string/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1061.java) | [:tv:](https://youtu.be/HvCaMw58_94) | Medium |Union Find
569570
| 1057 |[Campus Bikes](https://leetcode.com/problems/campus-bikes/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1057.java) | | Medium ||Greedy, Sort
570571
| 1056 |[Confusing Number](https://leetcode.com/problems/confusing-number/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) | | Easy ||
571572
| 1055 |[Fixed Point](https://leetcode.com/problems/fixed-point/)| [Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) | | Easy ||

‎src/main/java/com/fishercoder/solutions/_2536.java

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
package com.fishercoder.solutions;
2+
3+
public class _2536 {
4+
public static class Solution1 {
5+
public int[][] rangeAddQueries(int n, int[][] queries) {
6+
int[][] matrix = new int[n][n];
7+
for (int[] query : queries) {
8+
int row1 = query[0];
9+
int col1 = query[1];
10+
int row2 = query[2];
11+
int col2 = query[3];
12+
for (int i = row1; i <= row2; i++) {
13+
for (int j = col1; j <= col2; j++) {
14+
matrix[i][j]++;
15+
}
16+
}
17+
}
18+
return matrix;
19+
}
20+
}
21+
}

0 commit comments

Comments
 (0)