Leetcode
2020.05.05 12:45

# 844. Backspace String Compare

조회 수 385 추천 수 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;
}
}```

?

 제목+내용제목내용댓글이름닉네임아이디태그
1. 720. Longest Word in Dictionary

2. 225. Implement Stack using Queues

3. 56. Merge Intervals

4. 844. Backspace String Compare

5. 222. Count Complete Tree Nodes

6. 697. Degree of an Array

7. 605. Can Place Flowers

8. 724. Find Pivot Index

9. 448. Find All Numbers Disappeared in an Array

10. 628. Maximum Product of Three Numbers

11. 532. K-diff Pairs in an Array

12. 897. Increasing Order Search Tree

13. 872. Leaf-Similar Trees

14. 876. Middle of the Linked List

15. 203. Remove Linked List Elements

16. 997. Find the Town Judge

17. 270. Closest Binary Search Tree Value

18. 687. Longest Univalue Path

19. 783. Minimum Distance Between BST Nodes

20. 235. Lowest Common Ancestor of a Binary Search Tree

Board Pagination Prev 1 2 3 4 Next
/ 4