refactor 422

fishercoder1534 · fishercoder1534 · commit 62afbe90b7e0 · 2020-07-11T08:36:10.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_422.java b/src/main/java/com/fishercoder/solutions/_422.java
@@ -2,75 +2,6 @@
 
 import java.util.List;
 
-/**
- * 422. Valid Word Square
- *
- * Given a sequence of words, check whether it forms a valid word square.
-
- A sequence of words forms a valid word square if the kth row and column read the exact same string, where 0 ≤ k < max(numRows, numColumns).
-
- Note:
- The number of words given is at least 1 and does not exceed 500.
- Word length will be at least 1 and does not exceed 500.
- Each word contains only lowercase English alphabet a-z.
- Example 1:
-
- Input:
- [
- "abcd",
- "bnrt",
- "crmy",
- "dtye"
- ]
-
- Output:
- true
-
- Explanation:
- The first row and first column both read "abcd".
- The second row and second column both read "bnrt".
- The third row and third column both read "crmy".
- The fourth row and fourth column both read "dtye".
-
- Therefore, it is a valid word square.
- Example 2:
-
- Input:
- [
- "abcd",
- "bnrt",
- "crm",
- "dt"
- ]
-
- Output:
- true
-
- Explanation:
- The first row and first column both read "abcd".
- The second row and second column both read "bnrt".
- The third row and third column both read "crm".
- The fourth row and fourth column both read "dt".
-
- Therefore, it is a valid word square.
- Example 3:
-
- Input:
- [
- "ball",
- "area",
- "read",
- "lady"
- ]
-
- Output:
- false
-
- Explanation:
- The third row reads "read" while the third column reads "lead".
-
- Therefore, it is NOT a valid word square.
- */
 public class _422 {
 
     public static class Solution1 {
