-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStringEquivalents.java
More file actions
47 lines (45 loc) · 1.34 KB
/
Copy pathStringEquivalents.java
File metadata and controls
47 lines (45 loc) · 1.34 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
//1662. Check If Two String Arrays are Equivalent
//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.
public class StringEquivalents {
public boolean arrayStringsAreEqual(String[] word1, String[] word2) {
boolean value = false;
StringBuffer sb = new StringBuffer();
StringBuffer sb2 = new StringBuffer();
for(String i : word1)
sb.append(i);
for(String j : word2)
sb2.append(j);
if(String.valueOf(sb).equals(String.valueOf(sb2)))
value = true;
return value;
}
}