package leetcode;

import java.util.List;

/**
 * https://leetcode.com/problems/increasing-subsequences/
 */
public class Problem491 {
    public List<List<Integer>> findSubsequences(int[] nums) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem491 prob = new Problem491();
        System.out.println(prob.findSubsequences(new int[]{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]]
    }
}

@@ -323,16 +323,212 @@
 m491();%0A
+        System.out.println(prob.findSubsequences(new int%5B%5D%7B1, 1, 1%7D)); // %5B%5B1, 1%5D, %5B1, 1, 1%5D%5D%0A        System.out.println(prob.findSubsequences(new int%5B%5D%7B1, 2, 2%7D)); // %5B%5B1, 2%5D, %5B2, 2%5D, %5B1, 2, 2%5D%5D%0A
         

Update problem 491