491 Increasing Subsequences
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了491 Increasing Subsequences相关的知识,希望对你有一定的参考价值。
?????????https oid [] vat turn for set ems beat
491 Increasing Subsequences class Solution { public List<List<Integer>> findSubsequences(int[] nums) { Set<List<Integer>> set = new HashSet<>(); List<Integer> tempList = new ArrayList<>(); dfs(set, tempList, nums, 0); return new ArrayList<>(set); // new ArrayList<>(); } private void dfs(Set<List<Integer>> set, List<Integer> tempList, int[] nums, int index){ if(tempList.size() > 1){ set.add(new ArrayList<>(tempList)); } // add numbers for(int i = index; i < nums.length; i++){ if(tempList.size() == 0 || tempList.get(tempList.size() - 1) <= nums[i]){ tempList.add(nums[i]); dfs(set, tempList, nums, i + 1 ); // be careful , not index + 1 tempList.remove(tempList.size() - 1); } } } } https://www.youtube.com/watch?v=dl68syidyLM&t=242s ??????reference ??????????????????????????? ??? dfs ??? https://leetcode.com/problems/increasing-subsequences/discuss/97130/Java-20-lines-backtracking-solution-using-set-beats-100.
以上是关于491 Increasing Subsequences的主要内容,如果未能解决你的问题,请参考以下文章