首页 > 代码库 > 422. Valid Word Square
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 Solution { public boolean validWordSquare(List<String> words) { if(words.isEmpty() || words.size() == 0) return true; int len = words.size(); for(int i = 0 ; i < len ; i++){ StringBuilder s1 = new StringBuilder(); String s2 = words.get(i); for(int j = 0 ; j < s2.length() ; j++){ if(j >= words.size()) return false; if(words.get(j).length() <= i) return false; s1.append(words.get(j).charAt(i)); } if(!s1.toString().equals(s2)) return false; } return true; } }
422. Valid Word Square
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。