[leetcode] 422. Valid Word Square 解题报告

题目链接: https://leetcode.com/problems/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:trueExplanation: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:trueExplanation: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:falseExplanation:The third row reads "read" while the third column reads "lead".Therefore, it is NOT a valid word square

思路: 一个比较简单的题目, 把每一列的字符串提取出来放到hash表中即可. 然后比较一下是否相等.

代码如下:

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