From 6b9f4575fdcc90b989b979587eb556666745ff62 Mon Sep 17 00:00:00 2001 From: SinnoLn Date: Mon, 16 Nov 2026 23:58:35 +0900 Subject: [PATCH] 1081. Smallest Subsequence of Distinct Characters --- ...t Subsequence of Distinct Characters.java" | 32 +++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 "leetcode3/\354\235\264\354\247\204\355\235\254/1081. Smallest Subsequence of Distinct Characters.java" diff --git "a/leetcode3/\354\235\264\354\247\204\355\235\254/1081. Smallest Subsequence of Distinct Characters.java" "b/leetcode3/\354\235\264\354\247\204\355\235\254/1081. Smallest Subsequence of Distinct Characters.java" new file mode 100644 index 00000000..709ddc3d --- /dev/null +++ "b/leetcode3/\354\235\264\354\247\204\355\235\254/1081. Smallest Subsequence of Distinct Characters.java" @@ -0,0 +1,32 @@ +class Solution { + public String smallestSubsequence(String s) { + int[] lastIdx = new int[26]; + for (int i = 0; i < s.length(); i++) { + lastIdx[s.charAt(i)-'a'] = i; + } + + boolean[] check = new boolean[26]; + Deque sb = new ArrayDeque<>(); + + for (int i = 0; i < s.length(); i++) { + char c = s.charAt(i); + int idx = c-'a'; + + if (check[idx]) continue; + + while (!sb.isEmpty() && sb.peekLast() > c && lastIdx[sb.peekLast() - 'a'] > i) { + int idx = sb.poll()-'a'; + check[idx] = false; + } + + sb.addLast(c); + check[idx] = true; + } + + StringBuilder ans = new StringBuilder(); + + for (char c : ans) ans.append(c); + + return ans.toString(); + } +} \ No newline at end of file