10:I[13699,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 11:I[25152,["/_next/static/chunks/6b91a202b724e571.js","/_next/static/chunks/6710f67d945945a1.js","/_next/static/chunks/bde5ef9330c4de2d.js"],"default"] 12:T445,class Solution: def lexGreaterPermutation(self, s: str, target: str) -> str: cnt = [0] * 26 for i in range(len(s)): cnt[ord(s[i]) - ord("a")] += 1 cnt[ord(target[i]) - ord("a")] -= 1 # Try from right to left t = list(target) for i in range(len(s) - 1, -1, -1): b = ord(t[i]) - ord("a") cnt[b] += 1 # Reversal of consumption # Check if the prefix can fully match if min(cnt) < 0: continue # Find the smallest available character larger than b. for j in range(b + 1, 26): if cnt[j] > 0: cnt[j] -= 1 t[i] = chr(ord("a") + j) return "".join(t[: i + 1]) + self.getMinString(cnt) return "" # Get the lexicographically smallest string (in ascending order) def getMinString(self, cnt: list[int]) -> str: res = [] for i in range(26): res.extend([chr(i + ord("a"))] * cnt[i]) return "".join(res)13:T49b,class Solution { public String lexGreaterPermutation(String s, String target) { int[] cnt = new int[26]; for (int i = 0; i < s.length(); i++) { cnt[s.charAt(i) - 'a']++; cnt[target.charAt(i) - 'a']--; } char[] t = target.toCharArray(); for (int i = s.length() - 1; i >= 0; i--) { int b = t[i] - 'a'; cnt[b]++; boolean possible = true; for (int c : cnt) if (c < 0) possible = false; if (!possible) continue; for (int j = b + 1; j < 26; j++) { if (cnt[j] > 0) { cnt[j]--; t[i] = (char) ('a' + j); StringBuilder sb = new StringBuilder(); sb.append(t, 0, i + 1); for (int k = 0; k < 26; k++) { while (cnt[k] > 0) { sb.append((char) ('a' + k)); cnt[k]--; } } return sb.toString(); } } } return ""; } }14:T428,#include #include #include class Solution { public: std::string lexGreaterPermutation(std::string s, std::string target) { std::vector cnt(26, 0); int n = s.length(); for (int i = 0; i < n; i++) { cnt[s[i] - 'a']++; cnt[target[i] - 'a']--; } std::string t = target; for (int i = n - 1; i >= 0; i--) { int b = t[i] - 'a'; cnt[b]++; int min_val = 0; for (int c : cnt) min_val = std::min(min_val, c); if (min_val < 0) continue; for (int j = b + 1; j < 26; j++) { if (cnt[j] > 0) { cnt[j]--; t[i] = 'a' + j; std::string res = t.substr(0, i + 1); for (int k = 0; k < 26; k++) { res.append(cnt[k], 'a' + k); } return res; } } } return ""; } };

Time Complexity

Space Complexity