-
Notifications
You must be signed in to change notification settings - Fork 0
/
844. Backspace String Compare.cpp
72 lines (61 loc) · 1.68 KB
/
844. 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
// Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character.
// Note that after backspacing an empty text, the text will continue empty.
//
// 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".
//
// Constraints:
// 1 <= s.length, t.length <= 200
// s and t only contain lowercase letters and '#' characters.
// 来源:力扣(LeetCode)
// 链接:https://leetcode-cn.com/problems/backspace-string-compare
// 著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public:
bool backspaceCompare(string s, string t) {
vector<char> sstack;
vector<char> tstack;
for(const auto c:s)
{
if(c=='#')
{
if(sstack.size()!=0)
{
sstack.pop_back();
}
}
else
{
sstack.push_back(c);
}
}
for(const auto c:t)
{
if(c=='#')
{
if(tstack.size()!=0)
{
tstack.pop_back();
}
}
else {
tstack.push_back(c);
}
}
return sstack==tstack;
}
};