@@ -278,7 +278,36 @@ \subsubsection{Description}
278278\subsubsection {Solution }
279279
280280\begin {Code }
281+ public List<List<Integer>> permuteUnique(int[] nums) {
282+ List<List<Integer>> result = new ArrayList<List<Integer>>();
283+ permute(nums, result, 0);
284+ return result;
285+ }
281286
287+ public void permute(int[] nums, List<List<Integer>> result, int start) {
288+ if (start >= nums.length) {
289+ List<Integer> list = new ArrayList<Integer>();
290+ for (Integer n : nums) {
291+ list.add(n);
292+ }
293+ result.add(list);
294+ }
295+
296+ HashSet<Integer> set = new HashSet<Integer>();
297+ for (int i = start; i < nums.length; i++) {
298+ if (set.add(nums[i])) {
299+ swap(nums, start, i);
300+ permute(nums, result, start + 1);
301+ swap(nums, start, i);
302+ }
303+ }
304+ }
305+
306+ public static void swap(int[] nums, int left, int right) {
307+ int temp = nums[left];
308+ nums[left] = nums[right];
309+ nums[right] = temp;
310+ }
282311\end {Code }
283312
284313\newpage
@@ -307,25 +336,26 @@ \subsubsection{Solution}
307336
308337\begin {Code }
309338public String getPermutation(int n, int k) {
310- int[] nums = new int[n];
339+ int[] fac = new int[n + 1];
340+ fac[0] = 1;
311341
312- for (int i = 0; i < n; i++) {
313- nums[i] = i + 1;
314- }
342+ List<Integer> list = new LinkedList<>();
315343
316- for (int i = 1; i < k; i++) {
317- nextPermutation(nums);
344+ for (int i = 1; i <= n; i++) {
345+ fac[i] = fac[i - 1] * i;
346+ list.add(i);
318347 }
319348
349+ k--;
350+
320351 StringBuilder sb = new StringBuilder();
321- for (int i = 0; i < n; i++) {
322- sb.append(nums[i]);
352+ for (int i = 1; i <= n; i++) {
353+ int ind = k / fac[n - i];
354+ k % = fac[n - i];
355+ sb.append(list.remove(ind));
323356 }
324- return sb.toString();
325- }
326-
327- private void nextPermutation(int[] nums) {
328357
358+ return sb.toString();
329359}
330360\end {Code }
331361
@@ -435,11 +465,6 @@ \subsubsection{Solution}
435465 }
436466 trie.word = word;
437467}
438- \end {Code }
439-
440- \newpage
441-
442- \begin {Code }
443468
444469public List<String> findWords(char[][] board, String[] words) {
445470 Trie trie = new Trie();
@@ -454,7 +479,11 @@ \subsubsection{Solution}
454479 }
455480 return new LinkedList<String>(set);
456481}
482+ \end {Code }
457483
484+ \newpage
485+
486+ \begin {Code }
458487private void dfs(Set<String> set, char[][] board, int i, int j, Trie trie) {
459488 if (i < 0 || i >= board.length || j < 0 || j >= board[0].length) {
460489 return;
0 commit comments