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());
        }
    }
    
  • 相关阅读:
    SharePoint 2013 配置我的网站 图文引导
    关于SharePoint REST中的授权的研究
    SharePoint重置密码功能Demo
    SharePoint 沙盒解决方案 VS 场解决方案
    移动设备和SharePoint 2013
    win32
    win32
    链表复习-1
    win32
    洛谷基础算法
  • 原文地址:https://www.cnblogs.com/mapoos/p/14252030.html
Copyright © 2011-2022 走看看