Lintcode 888. Valid Word Square (Easy) (Python)

888. Valid Word Square

Description:

Given a sequence of words, check whether it forms a valid word square.

A sequence of words forms a valid word square if the k^th row and column read the exact same string, where 0 ≤ k < max(numRows, numColumns).

Example
Given
[
“abcd”,
“bnrt”,
“crmy”,
“dtye”
]
return 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.
Given
[
“abcd”,
“bnrt”,
“crm”,
“dt”
]
return 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.
Given
[
“ball”,
“area”,
“read”,
“lady”
]
return false

Explanation:
The third row reads “read” while the third column reads “lead”.

Therefore, it is NOT a valid word square.

Code:

class Solution:
    """
    @param words: a list of string
    @return: a boolean
    """
    def validWordSquare(self, words):
        # Write your code here
        l = len(words)
        for i in range(l):
            row, column = [], []
            row = list(words[i])
            lr = len(row)
            if lr > l:
                return False
            for j in range(len(row)):
                column.append(words[j][i])
            if row != column:
                return False
        return True