class Solution {
public String getPermutation(int n, int k) {
ArrayList<String> res = new ArrayList<>();
helper(n, res, new StringBuffer());
return res.get(k - 1);
}
private void helper(int n, ArrayList<String> res, StringBuffer s) {
if (s.length() == n) {
res.add(s.toString());
return;
}
for (int i = 1; i <= n; i++) {
if (s.toString().contains(i + "")) {
continue;
}
s.append(i);
helper(n, res, s);
s.deleteCharAt(s.length() - 1);
}
}
}
LeetCode精选100题——第60题——第k个排列
最新推荐文章于 2024-08-10 09:23:37 发布