add 1582

fishercoder1534 · fishercoder1534 · commit 3ef6e92bf947 · 2020-09-13T07:50:56.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1582|[Special Positions in a Binary Matrix](https://leetcode.com/problems/special-positions-in-a-binary-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1582.java) ||Array|Easy|
 |1576|[Replace All ?'s to Avoid Consecutive Repeating Characters](https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1576.java) |[:tv:](https://youtu.be/SJBDLYqrIsM)|String|Easy|
 |1574|[Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1574.java) ||Array, Binary Search|Medium|
 |1572|[Matrix Diagonal Sum](https://leetcode.com/problems/matrix-diagonal-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1572.java) ||Array|Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_1582.java b/src/main/java/com/fishercoder/solutions/_1582.java
@@ -0,0 +1,31 @@
+package com.fishercoder.solutions;
+
+public class _1582 {
+    public static class Solution1 {
+        public int numSpecial(int[][] mat) {
+            int count = 0;
+            for (int i = 0; i < mat.length; i++) {
+                for (int j = 0; j < mat[0].length; j++) {
+                    if (mat[i][j] == 1 && isSpecial(mat, i, j)) {
+                        count++;
+                    }
+                }
+            }
+            return count;
+        }
+
+        private boolean isSpecial(int[][] mat, int row, int col) {
+            for (int i = 0; i < mat.length; i++) {
+                if (i != row && mat[i][col] == 1) {
+                    return false;
+                }
+            }
+            for (int j = 0; j < mat[0].length; j++) {
+                if (j != col && mat[row][j] == 1) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1582Test.java b/src/test/java/com/fishercoder/_1582Test.java
@@ -0,0 +1,56 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1582;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1582Test {
+    private static _1582.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1582.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(3, solution1.numSpecial(new int[][]{
+                {0, 0, 0, 0, 0},
+                {1, 0, 0, 0, 0},
+                {0, 1, 0, 0, 0},
+                {0, 0, 1, 0, 0},
+                {0, 0, 0, 1, 1}
+        }));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(2, solution1.numSpecial(new int[][]{
+                {0, 0, 0, 1},
+                {1, 0, 0, 0},
+                {0, 1, 1, 0},
+                {0, 0, 0, 0}
+        }));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(3, solution1.numSpecial(new int[][]{
+                {1, 0, 0},
+                {0, 1, 0},
+                {0, 0, 1}
+        }));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(1, solution1.numSpecial(new int[][]{
+                {1, 0, 0},
+                {0, 0, 1},
+                {1, 0, 0}
+        }));
+    }
+
+}
