解题思路:
(1)判断words[i][j]==words[j][i]
class Solution {
public:
/**
* @param words: a list of string
* @return: a boolean
*/
bool validWordSquare(vector<string> &words) {
// Write your code here
for(int i=0;i<words.size();i++) {
for(int j=0;j<words[i].size();j++) {
if (words[i][j]!=words[j][i]) return false;
}
}
return true;
}
};