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:
Example 2:
Example 3:
Check if each row is the same as each column...
public boolean validWordSquare(List<string> words) { int m = words.size(); if (m == 0) { return true; } for (int i = 0; i < m; i++) { String w = words.get(i); for (int j = 0; j < w.length(); j++) { if (j >= m || words.get(j).length() <= i) { return false; } if (w.charAt(j) != words.get(j).charAt(i)) { return false; } } } return true; }
No comments:
Post a Comment