zoukankan      html  css  js  c++  java
  • 1662. Check If Two String Arrays are Equivalent (E)

    Check If Two String Arrays are Equivalent (E)

    题目

    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 <= 10^3
    • 1 <= word1[i].length, word2[i].length <= 10^3
    • 1 <= sum(word1[i].length), sum(word2[i].length) <= 10^3
    • word1[i] and word2[i] consist of lowercase letters.

    题意

    判断两个字符串数组拼接成的字符串是否相等。

    思路

    直接拼接比较。


    代码实现

    Java

    class Solution {
        public boolean arrayStringsAreEqual(String[] word1, String[] word2) {
            StringBuilder sb1 = new StringBuilder(), sb2 = new StringBuilder();
            for (String s : word1) sb1.append(s);
            for (String s : word2) sb2.append(s);
            return sb1.toString().equals(sb2.toString());
        }
    }
    
  • 相关阅读:
    mysql服务设置远程连接 解决1251 client does not support ..问题
    Docker的简单使用
    Kick Start 2018
    Kick Start 2018
    Kick Start 2018
    LeetCode——三维形体的表面积
    面试金典——按摩师
    LeetCode——使数组唯一的最小增量
    LeetCode——单词接龙 II
    LeetCode——N皇后 II
  • 原文地址:https://www.cnblogs.com/mapoos/p/14252030.html
Copyright © 2011-2022 走看看