3. DFS 做unique permutation: given input有duplicate characters。 Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation ...

Given an array A of positive integers (not necessarily distinct), return the lexicographically largest permutation that is smaller than A, that can be made with one swap (A swap exchanges the ...