459 491

Author: LuYanFCP

README.md

@@ -43,6 +43,7 @@ Leetcode刷题记录
 + No.77 [python](python/77.py)
 + No.97 [python](python/97.py)
 + No.111 [cpp](cpp/111.cpp)  easy
++ No.491 [cpp](cpp/491.cpp)
 + No.529 [cpp](cpp/529.cpp)
 + No.733 [cpp](cpp/733.cpp)
 
@@ -67,6 +68,7 @@ Leetcode刷题记录
 
 + No.136 [cpp](cpp/136.cpp)
 + No.64 [cpp](cpp/64.cpp) [python](python/64.py)
++ No.459 [cpp](cpp/459.cpp)
 
 ### 双指针
 

cpp/459.cpp

@@ -0,0 +1,9 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution {
+
+    bool repeatedSubstringPattern(string s) {
+        return (s+s).find(s, 1) != s.size();
+    }
+};

cpp/491.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Solution {
+public:
+/**
+ * dfs + set去重复
+ * 
+*/
+    vector<vector<int>> findSubsequences(vector<int>& nums) {
+        // unordered_map<int, vector<int>> cache;  /*第一个是int（pos）， 第二个是vector<int>, 存的缓存的结果*/
+        vector<int> pre;
+        set<vector<int>> res;
+        dfs(nums, 0, pre, -101, res);
+        return vector<vector<int>>(res.begin(), res.end());
+    }
+
+    void dfs(vector<int>& nums, int pos, vector<int> pre, int pre_value, set<vector<int>> &res) {
+        int n = nums.size();
+
+        if (pre.size()>1)
+            res.insert(pre);
+        for (int i = pos; i < n; ++i) {
+            if (nums[i] >= pre_value) {
+                pre.push_back(nums[i]);
+                dfs(nums, i+1, pre, nums[i], res);
+                pre.pop_back(); // 吐出去
+            }
+        }
+    }
+};