[LeetCode]491. Increasing Subsequences

最新推荐文章于 2023-02-25 22:41:55 发布

gqk289

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量228

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/gqk289/article/details/60330110

版权

LeetCode 专栏收录该内容

324 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/increasing-subsequences/?tab=Description

找到所有的递增子序列（子序列表示可以不连续，子数组必须连续）

用一个set保存在当前位置已经深搜过的值

public class Solution {
    public List<List<Integer>> findSubsequences(int[] nums) {
        List<List<Integer>> res = new LinkedList();
        List<Integer> part = new LinkedList();
        HashSet<Integer> set = new HashSet();
        for (int i = 0; i < nums.length ; i++) {
            if (set.contains(nums[i])) {
                continue;
            }
            set.add(nums[i]);
            part.add(nums[i]);
            dfs(nums, res, part, i);
            part.remove(part.size() - 1);
        }
        return res;
    }
    private void dfs(int[] nums, List<List<Integer>> res, List<Integer> part, int index) {
        if (part.size() >= 2) {
            res.add(new LinkedList(part));
        }
        if (index == nums.length - 1) {
            return;
        }
        HashSet<Integer> next = new HashSet();
        for (int i = index + 1; i < nums.length; i++) {
            if (nums[i] >= nums[index] && !next.contains(nums[i])) {
                next.add(nums[i]);
                part.add(nums[i]);
                dfs(nums, res, part, i);
                part.remove(part.size() - 1);
            }
        }
    }
}