https://leetcode.cn/problems/check-if-two-string-arrays-are-equivalent/

Author: masx200

README.md

@@ -47,6 +47,8 @@ Step 2. Add the dependency
 
 https://leetcode.cn/problems/inorder-successor-in-bst-ii/
 
+https://leetcode.cn/problems/check-if-two-string-arrays-are-equivalent/
+
 https://leetcode.cn/problems/boundary-of-binary-tree/
 
 https://leetcode.cn/problems/the-kth-factor-of-n/

check-if-two-string-arrays-are-equivalent/index.ts

@@ -0,0 +1,6 @@
+export default function arrayStringsAreEqual(
+    word1: string[],
+    word2: string[],
+): boolean {
+    return word1.join("") === word2.join("");
+}