【算法】1662. 检查两个字符串数组是否相等（多语言实现）

---

---

1637. 两点之间不包含任何点的最宽垂直面积：

给你两个字符串数组 word1 和 word2 。如果两个数组表示的字符串相同，返回 true ；否则，返回 false 。

数组表示的字符串 是由数组中的所有元素 按顺序 连接形成的字符串。

样例 1：

输入：
	word1 = ["ab", "c"], word2 = ["a", "bc"]
	
输出：
	true
	
解释：
	word1 表示的字符串为 "ab" + "c" -> "abc"
	word2 表示的字符串为 "a" + "bc" -> "abc"
	两个字符串相同，返回 true

样例 2：

输入：
	word1 = ["a", "cb"], word2 = ["ab", "c"]
	
输出：
	false

样例 3：

输入：
	word1  = ["abc", "d", "defg"], word2 = ["abcddefg"]
	
输出：
	true

提示：

• 1 <= word1.length, word2.length <= 10³
• 1 <= word1[i].length, word2[i].length <= 10³
• 1 <= sum(word1[i].length), sum(word2[i].length) <= 10³
• word1[i] 和 word2[i] 由小写字母组成

---

分析

• 面对这道算法题目，二当家的陷入了沉思。
• 按照题意，大概有两种思路。
• 一种是为了简单，快速，直接先拼接出字符串再比较，但是肯定会多用一些空间。
• 另外一种就是按顺序遍历，比第一种复杂，可能还会慢一些，但是可以节省空间。

---

题解

rust

impl Solution {
    pub fn array_strings_are_equal(word1: Vec<String>, word2: Vec<String>) -> bool {
        word1.concat() == word2.concat()
    }
}

---

go

func arrayStringsAreEqual(word1 []string, word2 []string) bool {
    return strings.Join(word1, "") == strings.Join(word2, "")
}

---

typescript

function arrayStringsAreEqual(word1: string[], word2: string[]): boolean {
    return word1.join('') === word2.join('');
};

---

c

bool arrayStringsAreEqual(char ** word1, int word1Size, char ** word2, int word2Size){
    int wi1 = 0, wi2 = 0, ci1 = 0, ci2 = 0;
    while (wi1 < word1Size
           && wi2 < word2Size) {
        while (word1[wi1][ci1]
               && word2[wi2][ci2]) {
            if (word1[wi1][ci1++] != word2[wi2][ci2++]) {
                return false;
            }
        }
        if (!word1[wi1][ci1]) {
            ++wi1;
            ci1 = 0;
        }
        if (!word2[wi2][ci2]) {
            ++wi2;
            ci2 = 0;
        }
    }
    return wi1 == word1Size
           && wi2 == word2Size;
}

---

c++

class Solution {
public:
    bool arrayStringsAreEqual(vector<string>& word1, vector<string>& word2) {
        int wi1 = 0, wi2 = 0, ci1 = 0, ci2 = 0;
        while (wi1 < word1.size()
               && wi2 < word2.size()) {
            while (ci1 < word1[wi1].length()
                   && ci2 < word2[wi2].length()) {
                if (word1[wi1][ci1++] != word2[wi2][ci2++]) {
                    return false;
                }
            }
            if (ci1 == word1[wi1].length()) {
                ++wi1;
                ci1 = 0;
            }
            if (ci2 == word2[wi2].length()) {
                ++wi2;
                ci2 = 0;
            }
        }
        return wi1 == word1.size()
               && wi2 == word2.size();
    }
};

---

python

class Solution:
    def arrayStringsAreEqual(self, word1: List[str], word2: List[str]) -> bool:
        return ''.join(word1) == ''.join(word2)
        

---

java

class Solution {
    public boolean arrayStringsAreEqual(String[] word1, String[] word2) {
        int wi1 = 0, wi2 = 0, ci1 = 0, ci2 = 0;
        while (wi1 < word1.length && wi2 < word2.length) {
            while (ci1 < word1[wi1].length() && ci2 < word2[wi2].length()) {
                if (word1[wi1].charAt(ci1++) != word2[wi2].charAt(ci2++)) {
                    return false;
                }
            }
            if (ci1 == word1[wi1].length()) {
                ++wi1;
                ci1 = 0;
            }
            if (ci2 == word2[wi2].length()) {
                ++wi2;
                ci2 = 0;
            }
        }
        return wi1 == word1.length && wi2 == word2.length;
    }
}

---

---

原题传送门：https://leetcode.cn/problems/check-if-two-string-arrays-are-equivalent/

---

非常感谢你阅读本文~
欢迎【👍点赞】【⭐收藏】【📝评论】~
放弃不难，但坚持一定很酷~
希望我们大家都能每天进步一点点~
本文由 二当家的白帽子：https://le-yi.blog.csdn.net/ 博客原创~

---