Formatted question description: https://leetcode.ca/all/422.html

# 422. Valid Word Square (Easy)

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:

1. The number of words given is at least 1 and does not exceed 500.
2. Word length will be at least 1 and does not exceed 500.
3. 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",
]

Output:
false

Explanation:

Therefore, it is NOT a valid word square.


Companies:

Similar Questions:

## Solution 1.

// OJ: https://leetcode.com/problems/valid-word-square/
// Time: O(MN)
// Space: O(1)
class Solution {
public:
bool validWordSquare(vector<string>& words) {
for (int i = 0, M = words.size(); i < M; ++i) {
for (int j = 0, N = words[i].size(); j < N; ++j) {
if (j >= M || i >= words[j].size() || words[i][j] != words[j][i]) return false;
}
}
return true;
}
};


Java

• class Solution {
public boolean validWordSquare(List<String> words) {
int rows = words.size();
for (int i = 0; i < rows; i++) {
String word = words.get(i);
int columns = word.length();
if (columns > rows)
return false;
for (int j = 0; j < columns; j++) {
char c1 = word.charAt(j);
if (words.get(j).length() <= i)
return false;
char c2 = words.get(j).charAt(i);
if (c1 != c2)
return false;
}
}
return true;
}
}

• // OJ: https://leetcode.com/problems/valid-word-square/
// Time: O(MN)
// Space: O(1)
class Solution {
public:
bool validWordSquare(vector<string>& words) {
for (int i = 0, M = words.size(); i < M; ++i) {
for (int j = 0, N = words[i].size(); j < N; ++j) {
if (j >= M || i >= words[j].size() || words[i][j] != words[j][i]) return false;
}
}
return true;
}
};

• class Solution(object):
def validWordSquare(self, words):
"""
:type words: List[str]
:rtype: bool
"""
for i in range(0, len(words)):
for j in range(0, len(words[i])):
if j >= len(words) or i >= len(words[j]) or words[j][i] != words[i][j]:
return False
return True