## 题目描述：

LeetCode 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:

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.
```

## 题目大意：

1. 单词个数在[1, 500]之间
2. 单词长度在[1, 500]之间
3. 每个单词只包含小写字母a-z

## 解题思路：

O(m * n)循环遍历即可，m为单词个数，n为单词长度。

## Python代码：

``````class Solution(object):
def validWordSquare(self, words):
"""
:type words: List[str]
:rtype: bool
"""
m = len(words)
n = len(words) if m else 0
if m != n:
return False
for x in range(m):
n = len(words[x])
c = 0
for y in range(m):
if len(words[y]) < x + 1:
break
c += 1
if c != n:
return False
for y in range(n):
if words[x][y] != words[y][x]:
return False
return True
``````

Pingbacks已关闭。