-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcheck-if-two-string-array-are-equivalent.cpp
65 lines (51 loc) · 1.48 KB
/
check-if-two-string-array-are-equivalent.cpp
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
//question//
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
//solution//
class Solution {
public:
bool arrayStringsAreEqual(vector<string>& word1, vector<string>& word2) {
string s1 = "";
string s2 = "";
for(int i=0;i<word1.size();i++)
{
s1 += word1[i];
}
for(int i=0;i<word2.size();i++)
{
s2 += word2[i];
}
int n1 = s1.size();
int n2 = s2.size();
if(n1!=n2)
{
return false;
}
for(int i=0;i<s1.size();i++)
{
if(s1[i]!=s2[i])
{
return false;
}
}
return true;
}
};