-
Notifications
You must be signed in to change notification settings - Fork 20
/
Copy pathProblem_4_Remove_Duplicate_Letters.java
34 lines (31 loc) · 1.09 KB
/
Problem_4_Remove_Duplicate_Letters.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
package Greedy_Algorithm;
// Problem Statement: Remove Duplicate Letters (medium)
// LeetCode Question: 316. Remove Duplicate Letters
import java.util.HashMap;
import java.util.HashSet;
import java.util.Stack;
public class Problem_4_Remove_Duplicate_Letters {
public String removeDuplicateLetters(String s) {
HashMap<Character, Integer> count = new HashMap<>();
HashSet<Character> present = new HashSet<>();
Stack<Character> result = new Stack<>();
for (char c : s.toCharArray()){
count.put(c, count.getOrDefault(c, 0) + 1);
}
for (char c : s.toCharArray()) {
if (!present.contains(c)) {
while (!result.isEmpty() && c < result.peek() && count.get(result.peek()) > 0) {
present.remove(result.pop());
}
result.push(c);
present.add(c);
}
count.put(c, count.get(c) - 1);
}
StringBuilder sb = new StringBuilder();
for (char c : result) {
sb.append(c);
}
return sb.toString();
}
}