leetcode 1662. Check If Two String Arrays are Equivalent（判断两个字符串数组是否相等）

蓝羽飞鸟

于 2022-10-25 18:00:00 发布

阅读量334

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode 算法数据结构

本文链接：https://blog.youkuaiyun.com/level_code/article/details/127509165

leetcode 专栏收录该内容

490 篇文章

订阅专栏

博客围绕判断两个字符串数组拼接后是否相等展开。给出示例，如输入[“ab”, “c”]和[“a”, “bc”]，拼接后均为“abc”，结果为true；输入[“a”, “cb”]和[“ab”, “c”]，拼接后不同，结果为false。思路是用StringBuilder拼接后判断。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

把两个字符串数组中的字符串拼接，然后判断它们是否相等。

思路：

用StringBuilder拼接，然后判断是否相等即可。

public boolean arrayStringsAreEqual(String[] word1, String[] word2) {
    StringBuilder str1 = new StringBuilder();
    StringBuilder str2 = new StringBuilder();
    int n = Math.max(word1.length, word2.length);
    
    for(int i = 0; i < n; i++) {
        if(i < word1.length) str1.append(word1[i]);
        if(i < word2.length) str2.append(word2[i]);
    }
    
    return str1.toString().equals(str2.toString());
}