题目描述:
给你两个字符串数组 word1
和 word2
。如果两个数组表示的字符串相同,返回 true
;否则,返回 false
。
数组表示的字符串 是由数组中的所有元素 按顺序 连接形成的字符串。
示例一:
输入:word1 = ["ab", "c"], word2 = ["a", "bc"]
输出:true
解释:
word1 表示的字符串为 "ab" + "c" -> "abc"
word2 表示的字符串为 "a" + "bc" -> "abc"
两个字符串相同,返回 true
示例二:
输入:word1 = ["a", "cb"], word2 = ["ab", "c"]
输出:false
示例三:
输入:word1 = ["abc", "d", "defg"], word2 = ["abcddefg"]
输出:true
提示:
1 <= word1.length, word2.length <= 103
1 <= word1[i].length, word2[i].length <= 103
1 <= sum(word1[i].length), sum(word2[i].length) <= 103
word1[i]
和word2[i]
由小写字母组成
思路:
先把两个字符串合并,再比较。
代码:
class Solution {
public:
string join(vector<string>& words) {
string ret = "";
for (auto &s : words) {
ret += s;
}
return ret;
}
bool arrayStringsAreEqual(vector<string>& word1, vector<string>& word2) {
return join(word1) == join(word2);
}
};
运行结果:![](https://i-blog.csdnimg.cn/blog_migrate/1b64e071e4011d4010e694fd2fb4ced0.png)