fd

Author: dingjikerbo

solution/src/main/java/com/inuker/solution/ValidWordSquare.java

@@ -13,16 +13,11 @@ public class ValidWordSquare {
 
     public boolean validWordSquare(List<String> words) {
         for (int i = 0; i < words.size(); i++) {
-            String word = words.get(i);
-            /**
-             * 如果单词长度比单词个数还多肯定是非法，因为横向和纵向长度不同
-             */
-            if (word.length() > words.size()) {
-                return false;
-            }
-            for (int j = 0; j < word.length(); j++) {
-                String s = words.get(j);
-                if (i >= s.length() || word.charAt(j) != s.charAt(i)) {
+            for (int j = 0; j < words.get(i).length(); j++) {
+                if (j >= words.size() || i >= words.get(j).length()) {
+                    return false;
+                }
+                if (words.get(i).charAt(j) != words.get(j).charAt(i)) {
                     return false;
                 }
             }

solution/src/main/java/com/inuker/solution/WordSquare.java renamed to solution/src/main/java/com/inuker/solution/WordSquares.java

@@ -16,7 +16,7 @@
  * 第一步建立所有前缀对应的字符串集合
  * 第二步依次填充
  */
-public class WordSquare {
+public class WordSquares {
 
     public List<List<String>> wordSquares(String[] words) {
         List<List<String>> ret = new ArrayList<List<String>>();

test/src/main/java/com/inuker/test/main.java

@@ -22,8 +22,17 @@ public static void main(String[] args) {
 
     }
 
-    class LFUCache {
-
-
+    public boolean validWordSquare(List<String> words) {
+        for (int i = 0; i < words.size(); i++) {
+            for (int j = 0; j < words.get(i).length(); j++) {
+                if (j >= words.size() || i >= words.get(j).length()) {
+                    return false;
+                }
+                if (words.get(i).charAt(j) != words.get(j).charAt(i)) {
+                    return false;
+                }
+            }
+        }
+        return true;
     }
 }