422. Valid Word Square

最新推荐文章于 2025-04-28 08:31:19 发布

原创最新推荐文章于 2025-04-28 08:31:19 发布 · 854 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #leetcode

字符串专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一种算法，用于检查一系列单词是否构成有效的单词方阵。有效单词方阵要求第k行与第k列完全相同，文章通过示例详细解释了这一概念，并提供了一个C++实现方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) {
        int n=words.size();
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<words[i].size();j++)
             if(words[i][j]!=words[j][i])
             return false;
        }
        return true;
    }
};