add 1476

fishercoder1534 · fishercoder1534 · commit 855953f8e497 · 2020-06-14T14:41:50.000-07:00
diff --git a/README.md b/README.md
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
-|1476|[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | |Easy|Array|
+|1476|[Subrectangle Queries](https://leetcode.com/problems/subrectangle-queries/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1476.java) | |Medium|Array|
+|1475|[Final Prices With a Special Discount in a Shop](https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1475.java) | |Easy|Array|
 |1471|[The k Strongest Values in an Array](https://leetcode.com/problems/the-k-strongest-values-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1471.java) | |Medium|Array, Sort|
 |1470|[Shuffle the Array](https://leetcode.com/problems/shuffle-the-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1470.java) | |Easy|Array|
 |1466|[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | |Medium|Tree, DFS|
diff --git a/src/main/java/com/fishercoder/solutions/_1476.java b/src/main/java/com/fishercoder/solutions/_1476.java
@@ -0,0 +1,29 @@
+package com.fishercoder.solutions;
+
+public class _1476 {
+    public static class Solution1 {
+        public static class SubrectangleQueries {
+            int[][] matrix;
+            int m;
+            int n;
+
+            public SubrectangleQueries(int[][] rectangle) {
+                m = rectangle.length;
+                n = rectangle[0].length;
+                matrix = rectangle;
+            }
+
+            public void updateSubrectangle(int row1, int col1, int row2, int col2, int newValue) {
+                for (int i = row1; i <= row2; i++) {
+                    for (int j = col1; j <= col2; j++) {
+                        matrix[i][j] = newValue;
+                    }
+                }
+            }
+
+            public int getValue(int row, int col) {
+                return matrix[row][col];
+            }
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1476Test.java b/src/test/java/com/fishercoder/_1476Test.java
@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1476;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1476Test {
+    private static _1476.Solution1.SubrectangleQueries solution1;
+    private static int[][] rectangle;
+
+    @Test
+    public void test1() {
+        rectangle = new int[][]{
+                {1, 2, 1},
+                {4, 3, 4},
+                {3, 2, 1},
+                {1, 1, 1}
+        };
+        solution1 = new _1476.Solution1.SubrectangleQueries(rectangle);
+        assertEquals(1, solution1.getValue(0, 2));
+        solution1.updateSubrectangle(0, 0, 3, 2, 5);
+        assertEquals(5, solution1.getValue(0, 2));
+    }
+
+}
