LeetCode #422. Valid Word Square

最新推荐文章于 2021-12-17 15:52:49 发布

原创最新推荐文章于 2021-12-17 15:52:49 发布 · 220 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

625 篇文章

订阅专栏

本文介绍了一种算法，用于检查给定的单词序列是否构成有效的单词方阵。有效单词方阵要求每一行和对应的列读取完全相同的字符串。文章通过示例详细解释了算法的工作原理，并提供了C++实现代码。

题目描述：

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:

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.

class Solution {
public:
    bool validWordSquare(vector<string>& words) {
        for(int i=0;i<words.size();i++)
        {
            for(int j=0;j<words[i].size();j++)
            {
                if(j>=words.size()||i>=words[j].size()||words[j][i]!=words[i][j]) 
                    return false;
            }
        }
        return true;
    }
};