diff --git a/src/main/java/leetcode/editor/cn/IncreasingSubsequences.java b/src/main/java/leetcode/editor/cn/IncreasingSubsequences.java
new file mode 100644
index 0000000..8c3fb5e
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/IncreasingSubsequences.java
@@ -0,0 +1,73 @@
+//给你一个整数数组 nums ，找出并返回所有该数组中不同的递增子序列，递增子序列中 至少有两个元素 。你可以按 任意顺序 返回答案。 
+//
+// 数组中可能含有重复元素，如出现两个整数相等，也可以视作递增序列的一种特殊情况。 
+//
+// 
+//
+// 示例 1： 
+//
+// 
+//输入：nums = [4,6,7,7]
+//输出：[[4,6],[4,6,7],[4,6,7,7],[4,7],[4,7,7],[6,7],[6,7,7],[7,7]]
+// 
+//
+// 示例 2： 
+//
+// 
+//输入：nums = [4,4,3,2,1]
+//输出：[[4,4]]
+// 
+//
+// 
+//
+// 提示： 
+//
+// 
+// 1 <= nums.length <= 15 
+// -100 <= nums[i] <= 100 
+// 
+// Related Topics 位运算 数组 哈希表 回溯 
+// 👍 319 👎 0
+
+package leetcode.editor.cn;
+
+import java.util.ArrayList;
+import java.util.List;
+
+//491:递增子序列
+class IncreasingSubsequences {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new IncreasingSubsequences().new Solution();
+        System.out.println(solution.findSubsequences(new int[]{4,6,7,7}));
+    }
+
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        private List<Integer> path = new ArrayList<>();
+        private List<List<Integer>> res = new ArrayList<>();
+        public List<List<Integer>> findSubsequences(int[] nums) {
+            backtracking(nums,0);
+            return res;
+        }
+
+        private void backtracking (int[] nums, int start) {
+            if (path.size() > 1) {
+                res.add(new ArrayList<>(path));
+            }
+
+            int[] used = new int[201];
+            for (int i = start; i < nums.length; i++) {
+                if (!path.isEmpty() && nums[i] < path.get(path.size() - 1) ||
+                        (used[nums[i] + 100] == 1)) continue;
+                used[nums[i] + 100] = 1;
+                path.add(nums[i]);
+                backtracking(nums, i + 1);
+                path.remove(path.size() - 1);
+            }
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}
\ No newline at end of file
diff --git a/src/main/java/leetcode/editor/cn/IncreasingSubsequences.md b/src/main/java/leetcode/editor/cn/IncreasingSubsequences.md
new file mode 100644
index 0000000..47ca76a
--- /dev/null
+++ b/src/main/java/leetcode/editor/cn/IncreasingSubsequences.md
@@ -0,0 +1,29 @@
+<p>给你一个整数数组 <code>nums</code> ，找出并返回所有该数组中不同的递增子序列，递增子序列中 <strong>至少有两个元素</strong> 。你可以按 <strong>任意顺序</strong> 返回答案。</p>
+
+<p>数组中可能含有重复元素，如出现两个整数相等，也可以视作递增序列的一种特殊情况。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [4,6,7,7]
+<strong>输出：</strong>[[4,6],[4,6,7],[4,6,7,7],[4,7],[4,7,7],[6,7],[6,7,7],[7,7]]
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>nums = [4,4,3,2,1]
+<strong>输出：</strong>[[4,4]]
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 15</code></li>
+	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
+</ul>
+<div><div>Related Topics</div><div><li>位运算</li><li>数组</li><li>哈希表</li><li>回溯</li></div></div>\n<div><li>👍 319</li><li>👎 0</li></div>
\ No newline at end of file