题目链接:https://leetcode.cn/problems/increasing-subsequences/
方法一 迭代
1 方法思想
2 代码实现
class Solution {
public List<List<Integer>> findSubsequences(int[] nums) {
backTracking(nums, 0);
return result;
}
List<List<Integer>> result = new ArrayList<>();
LinkedList<Integer> path = new LinkedList<>();
private void backTracking(int[] nums, int start) {
if (path.size() >= 2){
result.add(new ArrayList<>(path));
}
boolean[] used = new boolean[201];
for (int i = start; i < nums.length; i++) {
if (!path.isEmpty() && path.getLast() > nums[i] || used[100 + nums[i]]){
continue;
}
used[100+nums[i]] = true;
path.add(nums[i]);
backTracking(nums, i + 1);
path.removeLast();
}
}
}
3 复杂度分析
时间复杂度:
空间复杂度: