
-Code
public class LeetCode844 {
// Backspace String Compare
public boolean backspaceCompare(String s, String t) {
String sAns = solution(s);
String tAns = solution(t);
return sAns.equals(tAns);
}
// 문자열 조건을 통한 생성
private static String solution(String str) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < str.length(); i++) {
// #이면 이전 글자 삭제
if (str.charAt(i) == '#') {
if (!sb.isEmpty()) sb.deleteCharAt(sb.length() - 1);
} else {
sb.append(str.charAt(i));
}
}
return sb.toString();
}
}'알고리즘 문제 > Java' 카테고리의 다른 글
| [LeetCode/Java] Single Number (0) | 2026.07.14 |
|---|---|
| [LeetCode/Java] Missing Number (0) | 2026.07.13 |
| [LeetCode/Java] Unique Morse Code Words (0) | 2026.07.11 |
| [LeetCode/Java] Flood Fill (0) | 2026.07.10 |
| [LeetCode/Java] Shortest Completing Word (0) | 2026.07.09 |