add skeleton forc 1267

fishercoder1534 · fishercoder1534 · commit 345447f08936 · 2019-12-10T07:05:57.000-08:00
diff --git a/README.md b/README.md
@@ -11,6 +11,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1282|[Group the People Given the Group Size They Belong To](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1282.java) |  |  | |Medium||
 |1281|[Subtract the Product and Sum of Digits of an Integer](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1281.java) |  |  | |Easy||
 |1277|[Count Square Submatrices with All Ones](https://leetcode.com/problems/count-square-submatrices-with-all-ones/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1277.java) |  |  | |Medium||
+|1267|[Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1267.java) |  |  | |Medium||
 |1266|[Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1266.java) |  |  | |Easy||
 |1260|[Shift 2D Grid](https://leetcode.com/problems/shift-2d-grid/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1260.java) |  |  | [:tv:](https://www.youtube.com/watch?v=9hBcARSiU0s)|Easy||
 |1252|[Cells with Odd Values in a Matrix](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1252.java) | O(m*n + k) | O(m*n) | |Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_1267.java b/src/main/java/com/fishercoder/solutions/_1267.java
@@ -1,5 +1,7 @@
 package com.fishercoder.solutions;
 
+import com.fishercoder.common.utils.CommonUtils;
+
 /**
  * 1267. Count Servers that Communicate
  *
@@ -20,7 +22,6 @@
  *
  * Example 3:
  * Input: grid = [[1,1,0,0],[0,0,1,0],[0,0,1,0],[0,0,0,1]]
- *
  * Output: 4
  * Explanation: The two servers in the first row can communicate with each other.
  * The two servers in the third column can communicate with each other. The server at right bottom corner can't communicate with any other server.
@@ -34,8 +35,30 @@
  * */
 public class _1267 {
     public static class Solution1 {
+        /**credit: https://leetcode.com/problems/count-servers-that-communicate/discuss/436188/Java-or-Clean-And-Simple-or-Beats-100*/
         public int countServers(int[][] grid) {
-            return -1;
+            int m = grid.length;
+            int n = grid[0].length;
+            int[] rowCount = new int[m];
+            int[] columnCount = new int[n];
+            int total = 0;
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    if (grid[i][j] == 1) {
+                        rowCount[i]++;
+                        columnCount[j]++;
+                        total++;
+                    }
+                }
+            }
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    if (grid[i][j] == 1 && rowCount[i] == 1 && columnCount[j] == 1) {
+                        total--;
+                    }
+                }
+            }
+            return total;
         }
     }
 }
diff --git a/src/test/java/com/fishercoder/_1267Test.java b/src/test/java/com/fishercoder/_1267Test.java
@@ -0,0 +1,58 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1267;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1267Test {
+    private static _1267.Solution1 solution1;
+    private static int[][] grid;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1267.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        grid = new int[][]{
+                {1, 0},
+                {0, 1}
+        };
+        assertEquals(0, solution1.countServers(grid));
+    }
+
+    @Test
+    public void test2() {
+        grid = new int[][]{
+                {1, 0},
+                {1, 1}
+        };
+        assertEquals(3, solution1.countServers(grid));
+    }
+
+    @Test
+    public void test3() {
+        grid = new int[][]{
+                {1, 1, 0, 0},
+                {0, 0, 1, 0},
+                {0, 0, 1, 0},
+                {0, 0, 0, 1}
+        };
+        assertEquals(4, solution1.countServers(grid));
+    }
+
+    @Test
+    public void test4() {
+        grid = new int[][]{
+                {1, 1, 0, 0},
+                {1, 1, 1, 0},
+                {0, 0, 1, 0},
+                {0, 0, 0, 1}
+        };
+        assertEquals(6, solution1.countServers(grid));
+    }
+
+}
