491. Increasing Subsequences
来源:互联网 发布:深圳压寨网络是培训么 编辑:程序博客网 时间:2024/06/13 17:42
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.
Seen this question in a real interview before?
class Solution { public List<List<Integer>> findSubsequences(int[] nums) { LinkedHashSet<List<Integer>> data = new LinkedHashSet<>();for (int n : nums) {Iterator<List<Integer>> it = data.iterator();List<List<Integer>> addTemp = new ArrayList<>();while (it.hasNext()) {List<Integer> temp = it.next();if (n >= temp.get(temp.size() - 1)) {List<Integer> newList = new ArrayList<>(temp);newList.add(n);addTemp.add(newList);}}data.addAll(addTemp);List<Integer> addNew = new ArrayList<>();addNew.add(n);data.add(addNew);}List<List<Integer>> re = new ArrayList<>();Iterator<List<Integer>> it = data.iterator();while (it.hasNext()) {List<Integer> temp = it.next();if (temp.size() > 1)re.add(temp);}return re; }}
阅读全文
0 0
- 【LeetCode】 491. Increasing Subsequences
- 491. Increasing Subsequences**
- 491. Increasing Subsequences
- LeetCode 491. Increasing Subsequences
- 491. Increasing Subsequences
- 491. Increasing Subsequences
- LeetCode 491. Increasing Subsequences
- [LeetCode]491. Increasing Subsequences
- 491. Increasing Subsequences
- [leetcode]491. Increasing Subsequences
- 【Leetcode】491. Increasing Subsequences
- [leetcode] 491. Increasing Subsequences
- 491. Increasing Subsequences
- Leetcode -- 491. Increasing Subsequences
- leetcode-491. Increasing Subsequences
- (LeetCode) 491. Increasing Subsequences
- 491. Increasing Subsequences
- LeetCode 491. Increasing Subsequences
- NKOJ 2993 (NOI 2014)动物园(KMP+栈)
- android通过sdk调不起微信原因
- Django数据库多对多数据关系
- hihocoder 1445 : 后缀自动机二·重复旋律5(后缀自动机)
- SQL Server 2012 2016 2017 新增函数
- 491. Increasing Subsequences
- 随机森林参数调整
- C#222课的主要内容
- TextView设置文字竖着排放
- [Kafka]Monitor Kafka with jmxtrans
- C++中的虚函数表
- HYSBZ2565-最长双回文串
- 装系统步骤
- Makefile框架