Leetcode
2020.05.05 12:45

844. Backspace String Compare

조회 수 672 추천 수 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.

Follow up:

  • 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{
                list.add(str.charAt(i));
            }
        }
        
        //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;
    }
}

[문제] https://leetcode.com/problems/backspace-string-compare/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 720. Longest Word in Dictionary hooni 2020.05.07 793
76 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 687
75 Leetcode 56. Merge Intervals hooni 2020.05.05 641
» Leetcode 844. Backspace String Compare hooni 2020.05.05 672
73 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 665
72 Leetcode 697. Degree of an Array hooni 2020.05.05 739
71 Leetcode 605. Can Place Flowers hooni 2020.05.05 647
70 Leetcode 724. Find Pivot Index hooni 2020.05.05 672
69 Leetcode 448. Find All Numbers Disappeared in an Array hooni 2020.05.05 620
68 Leetcode 628. Maximum Product of Three Numbers hooni 2020.05.05 622
67 Leetcode 532. K-diff Pairs in an Array hooni 2020.05.04 675
66 Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 642
65 Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 629
64 Leetcode 876. Middle of the Linked List hooni 2020.05.04 629
63 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 605
62 Leetcode 997. Find the Town Judge hooni 2020.05.02 670
61 Leetcode 270. Closest Binary Search Tree Value hooni 2020.05.01 608
60 Leetcode 687. Longest Univalue Path hooni 2020.05.01 674
59 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 685
58 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree file hooni 2020.05.01 672
Board Pagination Prev 1 2 3 4 Next
/ 4