package LeetCode;

import java.util.ArrayList;
import java.util.List;

public class LC_491_wrong {
    static List<List<Integer>> res = new ArrayList<>();
    static ArrayList<Integer> path = new ArrayList<>();

    public static void main(String[] args) {
        int[] nums = {1,2,3,4,5,6,7,8,9,10,1,1,1,1,1};
        findSubsequences(nums);
    }

    public static List<List<Integer>> findSubsequences(int[] nums) {
        backtracking(nums, 0);
        System.out.println(res);
        return res;
    }

    public static void backtracking(int[] nums, int startIdx) {
        if (startIdx > nums.length) return;
        if (isValid(path))
            res.add(new ArrayList<>(path));
        for (int i = startIdx; i < nums.length; i++) {
            if (i > startIdx && nums[i - 1] == nums[i]) continue;
            else {
                path.add(nums[i]);
                backtracking(nums, i + 1);
                path.remove(path.size() - 1);
            }
        }
    }

    public static boolean isValid(ArrayList<Integer> path) {
        if (path.size() < 2) return false;
        int[] pathNum = path.stream().mapToInt(Integer::intValue).toArray();
        for (int i = 0; i < pathNum.length-1; i++) {
            if(pathNum[i]>pathNum[i+1]) return false;
        }
        return true;
    }

}