-
Notifications
You must be signed in to change notification settings - Fork 40
/
BackspaceStringCompare.js
58 lines (54 loc) · 1.38 KB
/
BackspaceStringCompare.js
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
// Source : https://leetcode.com/problems/backspace-string-compare
// Author : Dean Shi
// Date : 2018-08-25
/***************************************************************************************
* 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?
*
***************************************************************************************/
/**
* @param {string} S
* @param {string} T
* @return {boolean}
*/
var backspaceCompare = function(S, T) {
const sStack = []
const tStack = []
for (let c of S) c !== '#' ? sStack.push(c) : sStack.pop()
for (let c of T) c !== '#' ? tStack.push(c) : tStack.pop()
return sStack.join('') === tStack.join('')
};