LeetCode 491. Increasing Subsequences

最新推荐文章于 2024-11-04 12:20:00 发布

Cloud陈

最新推荐文章于 2024-11-04 12:20:00 发布

阅读量256

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/shengyingpo/article/details/58216388

版权

LeetCode 专栏收录该内容

161 篇文章 0 订阅

订阅专栏

public class Solution {
    public List<List<Integer>> findSubsequences(int[] nums) {
        Set<List<Integer>> list = new HashSet<List<Integer>>();
        for (int i = 0; i < nums.length - 1; i++) {
        	List<List<Integer>> tmp = new ArrayList<List<Integer>>();
        	List<Integer> firstList = new ArrayList<Integer>();
        	firstList.add(nums[i]);
        	tmp.add(firstList);
        	for (int j = i + 1; j < nums.length; j++) {
        		List<List<Integer>> t = new ArrayList<List<Integer>>();
        		for (List<Integer> tmpList : tmp) {
        			List<Integer> ll = new ArrayList<Integer>();
        			ll.addAll(tmpList);
        			if (ll.get(ll.size() - 1) <= nums[j] && (nums[j] != nums[j - 1] || ll.contains(nums[j]))) {
        				ll.add(nums[j]);
            			t.add(ll);
        			}
        		}
        		for (List<Integer> tmpList : t) tmp.add(tmpList);
        	}
        	if (tmp.size() > 1) {
	        	tmp.remove(0);
	        	for (List<Integer> tmpList : tmp) list.add(tmpList);
        	}
        }
        return new ArrayList(list);
    }
}