-
Notifications
You must be signed in to change notification settings - Fork 22
/
Copy pathBackspaceStringCompare_844.java
52 lines (44 loc) · 1.46 KB
/
BackspaceStringCompare_844.java
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
package com.leetcode.problems.easy;
import java.util.Stack;
/**
* @author neeraj on 15/09/19
* Copyright (c) 2019, data-structures.
* All rights reserved.
*/
public class BackspaceStringCompare_844 {
public static void main(String[] args) {
System.out.println(backspaceCompare("ab#c", "ad#c"));
System.out.println(backspaceCompare("ab##", "#a#c"));
System.out.println(backspaceCompare("a##c", "#a#c"));
System.out.println(backspaceCompare("a#c", "b"));
System.out.println(backspaceCompare("y#fo##f", "y#f#o##f"));
}
public static boolean backspaceCompare(String S, String T) {
Stack<Character> first = new Stack<>();
Stack<Character> second = new Stack<>();
for (char c : S.toCharArray()) {
if (c != '#') {
first.push(c);
} else if (!first.isEmpty()) {
first.pop();
}
}
for (char c : T.toCharArray()) {
if (c != '#') {
second.push(c);
} else if (!second.isEmpty()) {
second.pop();
}
}
if (first.size() != second.size()) {
return false;
}
StringBuffer sb1 = new StringBuffer();
StringBuffer sb2 = new StringBuffer();
while (!first.isEmpty()) {
sb1.append(first.pop());
sb2.append(second.pop());
}
return sb1.toString().equalsIgnoreCase(sb2.toString());
}
}