-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcheck_if_two_string_arrays_are_equivalent.py
More file actions
56 lines (37 loc) · 1.45 KB
/
check_if_two_string_arrays_are_equivalent.py
File metadata and controls
56 lines (37 loc) · 1.45 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
"""
1662. Check If Two String Arrays are Equivalent
Difficulty:Easy
Given two string arrays word1 and word2, return true if the two arrays represent the same string, and false otherwise.
A string is represented by an array if the array elements concatenated in order forms the string.
Example 1:
Input: word1 = ["ab", "c"], word2 = ["a", "bc"]
Output: true
Explanation:
word1 represents string "ab" + "c" -> "abc"
word2 represents string "a" + "bc" -> "abc"
The strings are the same, so return true.
Example 2:
Input: word1 = ["a", "cb"], word2 = ["ab", "c"]
Output: false
Example 3:
Input: word1 = ["abc", "d", "defg"], word2 = ["abcddefg"]
Output: true
Constraints:
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] and word2[i] consist of lowercase letters.
"""
from typing import List
class Solution:
def arrayStringsAreEqual(self, word1: List[str], word2: List[str]) -> bool:
# word1.sort()
# word2.sort()
word1_to_string = ''.join(word1)
word2_to_string = ''.join(word2)
return word1_to_string == word2_to_string
if __name__ == "__main__":
solution = Solution()
print(solution.arrayStringsAreEqual(word1=["ab","c"], word2=["a","bc"])) # true
print(solution.arrayStringsAreEqual(word1=["a","cb"], word2=["ab","c"])) # false
print(solution.arrayStringsAreEqual(word1=["abc","d", "defg"], word2=["abcddefg"])) # true