Leetcode
2020.05.05 12:45

# 844. Backspace String Compare

조회 수 748 추천 수 0 댓글 0
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

#### 단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

Given two strings `S` and `T`, return 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".
```

Note:

• `1 <= S.length <= 200`
• `1 <= T.length <= 200`
• `S` and `T` only contain lowercase letters and `'#'` characters.

• Can you solve it in `O(N)` time and `O(1)` space?

```class Solution {
public boolean backspaceCompare(String S, String T) {
return makeString(S).equals(makeString(T));
}

public List<Character> makeString(String str){
List<Character> list = new ArrayList<>();

for(int i=0; i<str.length(); i++){
if(str.charAt(i) == '#'){
if(list.size() > 0){
list.remove(list.size() - 1);
}
}else{
}
}

//return list.stream().map(e->e.toString()).collect(Collectors.joining());
return list;
}
}```

```class Solution {
public boolean backspaceCompare(String S, String T) {
return makeString(S).equals(makeString(T));
}

public Stack<Character> makeString(String str){
Stack<Character> stack = new Stack();

for(int i=0; i<str.length(); i++){
if(str.charAt(i) != '#'){
stack.push(str.charAt(i));
}else if(stack.size() > 0){
stack.pop();
}
}

//return String.valueOf(stack);
return stack;
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 720. Longest Word in Dictionary 2020.05.07 846
76 Leetcode 697. Degree of an Array 2020.05.05 786
» Leetcode 844. Backspace String Compare 2020.05.05 748
74 Leetcode 225. Implement Stack using Queues 2020.05.05 740
73 Leetcode 532. K-diff Pairs in an Array 2020.05.04 728
72 Leetcode 783. Minimum Distance Between BST Nodes 2020.05.01 728
71 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree 2020.05.01 721
70 Leetcode 997. Find the Town Judge 2020.05.02 718
69 Leetcode 687. Longest Univalue Path 2020.05.01 717
68 Leetcode 724. Find Pivot Index 2020.05.05 716
67 Leetcode 222. Count Complete Tree Nodes 2020.05.05 713
66 Leetcode 605. Can Place Flowers 2020.05.05 697
65 Leetcode 56. Merge Intervals 2020.05.05 691
64 Leetcode 897. Increasing Order Search Tree 2020.05.04 687
63 Leetcode 448. Find All Numbers Disappeared in an Array 2020.05.05 682
62 Leetcode 872. Leaf-Similar Trees 2020.05.04 679
61 Leetcode 876. Middle of the Linked List 2020.05.04 678
60 Leetcode 628. Maximum Product of Three Numbers 2020.05.05 672
59 Leetcode 270. Closest Binary Search Tree Value 2020.05.01 659
58 Leetcode 203. Remove Linked List Elements 2020.05.04 653
Board Pagination Prev 1 2 3 4 Next
/ 4