Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 1662 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 1662 # by problem number
lcpy gen -s array_strings_are_equal # by problem name
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.
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.
Input: word1 = ["a", "cb"], word2 = ["ab", "c"]
Output: false
Input: word1 = ["abc", "d", "defg"], word2 = ["abcddefg"]
Output: true
from collections.abc import Iterator
from itertools import zip_longest
class Solution:
# Time: O(n + m)
# Space: O(1)
def array_strings_are_equal(self, word1: list[str], word2: list[str]) -> bool:
return all(a == b for a, b in zip_longest(self._chars(word1), self._chars(word2)))
def _chars(self, words: list[str]) -> Iterator[str]:
for word in words:
yield from word
| Time | Space |
|---|---|
| O(n + m) | O(1) |