check-if-two-string-arrays-are-equivalent

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given two string arrays <code>word1</code> and <code>word2</code>, return <code>true</code> if the two arrays represent the same string, and <code>false</code> otherwise.

A string is represented by an array if the array elements concatenated in order forms the string.

&nbsp;
Example 1:

<pre>
Input: word1 = [&quot;ab&quot;, &quot;c&quot;], word2 = [&quot;a&quot;, &quot;bc&quot;]
Output: true
Explanation:
word1 represents string &quot;ab&quot; + &quot;c&quot; -&gt; &quot;abc&quot;
word2 represents string &quot;a&quot; + &quot;bc&quot; -&gt; &quot;abc&quot;
The strings are the same, so return true.</pre>

Example 2:

<pre>
Input: word1 = [&quot;a&quot;, &quot;cb&quot;], word2 = [&quot;ab&quot;, &quot;c&quot;]
Output: false
</pre>

Example 3:

<pre>
Input: word1 = [&quot;abc&quot;, &quot;d&quot;, &quot;defg&quot;], word2 = [&quot;abcddefg&quot;]
Output: true
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= word1.length, word2.length &lt;= 103</code></li>
	<li><code>1 &lt;= word1[i].length, word2[i].length &lt;= 103</code></li>
	<li><code>1 &lt;= sum(word1[i].length), sum(word2[i].length) &lt;= 103</code></li>
	<li><code>word1[i]</code> and <code>word2[i]</code> consist of lowercase letters.</li>
</ul>

arrayStringsAreEqual

Check If Two String Arrays are Equivalent

Check if an Original String Exists Given Two Encoded Strings

check-if-an-original-string-exists-given-two-encoded-strings

同源字符串检测

Array

String

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

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

 

示例 1：

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

示例 2：

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

示例 3：

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

 

提示：

<ul>
	<li><code>1 <= word1.length, word2.length <= 103</code></li>
	<li><code>1 <= word1[i].length, word2[i].length <= 103</code></li>
	<li><code>1 <= sum(word1[i].length), sum(word2[i].length) <= 103</code></li>
	<li><code>word1[i]</code> 和 <code>word2[i]</code> 由小写字母组成</li>
</ul>