Loading

摘要: 46. 全排列 思路:典型回溯法 class Solution { public List<List<Integer>> permute(int[] nums) { LinkedList<Integer> track = new LinkedList<>(); boolean[] visited = 阅读全文
posted @ 2021-06-30 20:02 WINLSR 阅读(58) 评论(0) 推荐(0) 编辑