-
Notifications
You must be signed in to change notification settings - Fork 0
/
Backspace String Compare.cpp
82 lines (70 loc) · 1.65 KB
/
Backspace String Compare.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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/*
Given two strings S and T, return if they are equal when both are typed into empty text editors. # means a backspace character.
Example 1:
Input: S = "ab#c", T = "ad#c"
Output: true
Explanation: Both S and T become "ac".
Example 2:
Input: S = "ab##", T = "c#d#"
Output: true
Explanation: Both S and T become "".
Example 3:
Input: S = "a##c", T = "#a#c"
Output: true
Explanation: Both S and T become "c".
Example 4:
Input: S = "a#c", T = "b"
Output: false
Explanation: S becomes "c" while T becomes "b".
Note:
1 <= S.length <= 200
1 <= T.length <= 200
S and T only contain lowercase letters and '#' characters.
Follow up:
Can you solve it in O(N) time and O(1) space?
*/
class Solution {
public:
bool backspaceCompare(string S, string T) {
vector<char> tmp1,tmp2;
for(long long int i=0;i<S.length();i++)
{
if(S[i] == '#')
{
if(tmp1.size()!=0)
{
tmp1.pop_back();
}
}
else
{
tmp1.push_back(S[i]);
}
}
for(long long int i=0;i<T.length();i++)
{
if(T[i] == '#')
{
if(tmp2.size()!=0)
{
tmp2.pop_back();
}
}
else
{
tmp2.push_back(T[i]);
}
}
// string s1(tmp1.begin(),tmp1.end());
// string s2(tmp2.begin(),tmp2.end());
// cout<<s1<<" "<<s2;
if(tmp1 == tmp2)
{
return true;
}
else
{
return false;
}
}
};