From b4e20edd83b6943d53eca263702d42c643168327 Mon Sep 17 00:00:00 2001 From: oheunhyuck <71165142+oheunhyuck@users.noreply.github.com> Date: Mon, 16 Nov 2026 05:45:18 +0900 Subject: [PATCH] Create 1081. Smallest Subsequence of Distinct Characters --- ...allest Subsequence of Distinct Characters" | 35 +++++++++++++++++++ 1 file changed, 35 insertions(+) create mode 100644 "leetcode3/\354\230\244\354\235\200\355\230\201/1081. Smallest Subsequence of Distinct Characters" diff --git "a/leetcode3/\354\230\244\354\235\200\355\230\201/1081. Smallest Subsequence of Distinct Characters" "b/leetcode3/\354\230\244\354\235\200\355\230\201/1081. Smallest Subsequence of Distinct Characters" new file mode 100644 index 00000000..ee150d97 --- /dev/null +++ "b/leetcode3/\354\230\244\354\235\200\355\230\201/1081. Smallest Subsequence of Distinct Characters" @@ -0,0 +1,35 @@ +class Solution: + def smallestSubsequence(self, s: str) -> str: + + v=[set() for _ in range(len(s))] + trace=set() + for i in range(len(s)-1,-1,-1): + for t in trace: + v[i].add(t) + trace.add(s[i]) + stack=[] + for i,c in enumerate(s): + if c in stack :continue + if not stack: + stack.append(c) + continue + if stack[-1]c and stack[-1] in v[i]: + + stack.pop() + else:break + stack.append(c) + + return "".join(stack) + + + + + + + +