491. Increasing Subsequences**

最新推荐文章于 2024-01-20 15:08:16 发布

Yingying_code

最新推荐文章于 2024-01-20 15:08:16 发布

阅读量831

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode Java backtracking

本文链接：https://blog.csdn.net/alwaystry/article/details/54692902

leetcode 同时被 3 个专栏收录

261 篇文章

订阅专栏

Java

188 篇文章

订阅专栏

backtracking

12 篇文章

订阅专栏

本文介绍了一种通过回溯算法找出整数数组中所有不同可能的递增子序列的方法，长度至少为2。示例输入[4,6,7,7]，输出包括[[4,6],[4,7],[4,6,7],[4,6,7,7],[6,7],[6,7,7],[7,7],[4,7,7]]等。考虑到数组可能包含重复元素，且长度不超过15。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 .

Example:

Input: [4, 6, 7, 7]
Output: [[4, 6], [4, 7], [4, 6, 7], [4, 6, 7, 7], [6, 7], [6, 7, 7], [7,7], [4,7,7]]

Note:

The length of the given array will not exceed 15.
The range of integer in the given array is [-100,100].
The given array may contain duplicates, and two equal integers should also be considered as a special case of increasing sequence.

public class Solution {
    public List<List<Integer>> findSubsequences(int[] nums) {
        Set<List<Integer>> list = new HashSet<List<Integer>>();
        backtrack(list,new ArrayList<>(),nums,0);
        return new ArrayList(list);
    }
    private void backtrack(Set<List<Integer>> list, List<Integer> tempList, int[] nums,int start){
        if (tempList.size()>1) list.add(new ArrayList<>(tempList));
        for(int i=start;i<nums.length;i++){
            if(tempList.size()==0||tempList.get(tempList.size()-1)<=nums[i]){
               tempList.add(nums[i]);
               backtrack(list,tempList,nums,i+1);
               tempList.remove(tempList.size()-1);
            }
        }
    }
}

总结：万变不离其宗，但是几天没看就生疏了。