forked from haoel/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
BackspaceStringCompare.cpp
83 lines (80 loc) · 1.61 KB
/
BackspaceStringCompare.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
81
82
83
// Source : https://leetcode.com/problems/backspace-string-compare/description/
// Author : Hao Chen
// Date : 2018-06-29
/***************************************************************************************
*
* 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 {
private:
void removeBackspaces(string &s) {
int i = 0;
for(int i=0; i<s.size(); i++) {
if (s[i] == '#') {
int backSteps = i>0 ? 2 : 1;
s.erase(i-backSteps + 1, backSteps);
i -= backSteps;
}
}
}
public:
bool backspaceCompare(string S, string T) {
removeBackspaces(S);
removeBackspaces(T);
return S == T;
}
};