refactor 531

fishercoder1534 · fishercoder1534 · commit 165cf3410ad3 · 2020-07-15T09:18:11.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_531.java b/src/main/java/com/fishercoder/solutions/_531.java
@@ -1,24 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 531. Lonely Pixel I
- *
- * Given a picture consisting of black and white pixels, find the number of black lonely pixels.
- * The picture is represented by a 2D char array consisting of 'B' and 'W', which means black and white pixels respectively.
- * A black lonely pixel is character 'B' that located at a specific position where the same row and same column don't have any other black pixels.
-
- Example:
- Input:
- [['W', 'W', 'B'],
- ['W', 'B', 'W'],
- ['B', 'W', 'W']]
-
- Output: 3
- Explanation: All the three 'B's are black lonely pixels.
-
- Note:
- The range of width and height of the input 2D array is [1,500].
- */
 public class _531 {
 
     public static class Solution1 {
