422. Valid Word Square

• Difficulty: Easy

• Topics:

• Similar Questions:

  • Word Squares

  • Toeplitz Matrix

Problem:

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

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",
  "read",
  "lady"
]

Output: false

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

Therefore, it is NOT a valid word square. </pre> </p>

Solutions:

class Solution {
public:
    bool validWordSquare(vector<string>& words) {
        int m = words.size();
        if (m == 0) return true;
        int n = words[0].size();
        if (n == 0) return true;
        if (m != n) return false;

        for (int i = 0; i <m; ++i) {
            if (words[i].length() > m)  return false;
            for (int j = 0; j < i; ++j) {
                if (j >= words[i].length() && i >= words[j].length()) {
                    continue;
                }
                else if (j < words[i].length() && j < words[j].length()) {
                    if (words[i][j] != words[j][i]) return false;
                }
                else 
                    return false;
            }
        }

        return true;

    }
};