feat: add solutions to lcof2 problems: No.015, 016 (#646)

* No.015.Find All Anagrams in a String
* No.016.Longest Substring Without Repeating Characters

Author: Yousazoe

lcof2/剑指 Offer II 015. 字符串中的所有变位词/README.md

@@ -150,6 +150,40 @@ func check(window []int) bool {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> findAnagrams(string s, string p) {
+        vector<int> res;
+        vector<int> hash(26, 0), zero(26, 0);
+
+        if (p.size() > s.size())
+            return res;
+
+        for (int i = 0; i < p.size(); i++) {
+            hash[p[i] - 'a']++;
+            hash[s[i] - 'a']--;
+        }
+
+        if (hash == zero)
+            res.push_back(0);
+
+        for (int i = p.size(); i < s.size(); i++) {
+            hash[s[i] - 'a']--;
+            hash[s[i - p.size()] - 'a']++;
+
+            if (hash == zero)
+                res.push_back(i - p.size() + 1);
+        }    
+
+
+        return res;
+    }
+};
+```
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 015. 字符串中的所有变位词/Solution.cpp

@@ -0,0 +1,29 @@
+class Solution {
+public:
+    vector<int> findAnagrams(string s, string p) {
+        vector<int> res;
+        vector<int> hash(26, 0), zero(26, 0);
+
+        if (p.size() > s.size())
+            return res;
+
+        for (int i = 0; i < p.size(); i++) {
+            hash[p[i] - 'a']++;
+            hash[s[i] - 'a']--;
+        }
+
+        if (hash == zero)
+            res.push_back(0);
+
+        for (int i = p.size(); i < s.size(); i++) {
+            hash[s[i] - 'a']--;
+            hash[s[i - p.size()] - 'a']++;
+
+            if (hash == zero)
+                res.push_back(i - p.size() + 1);
+        }
+
+
+        return res;
+    }
+};

lcof2/剑指 Offer II 016. 不含重复字符的最长子字符串/README.md

@@ -134,6 +134,34 @@ func max(a, b int) int {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int lengthOfLongestSubstring(string s) {
+        if (s.size() == 0)
+            return 0;
+
+        int left = 0;
+        int maxlen = 0;
+        unordered_set<char> hash;
+
+        for (int right = 0; right < s.size(); right++) {
+            while (hash.find(s[right]) != hash.end()) {
+                hash.erase(s[left]);
+                left++;
+            }
+
+            hash.insert(s[right]);
+            maxlen = max(maxlen, right - left + 1);
+        }
+
+        return maxlen;
+    }
+};
+```
+
 ### **...**
 
 ```

lcof2/剑指 Offer II 016. 不含重复字符的最长子字符串/Solution.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    int lengthOfLongestSubstring(string s) {
+        if (s.size() == 0)
+            return 0;
+
+        int left = 0;
+        int maxlen = 0;
+        unordered_set<char> hash;
+
+        for (int right = 0; right < s.size(); right++) {
+            while (hash.find(s[right]) != hash.end()) {
+                hash.erase(s[left]);
+                left++;
+            }
+
+            hash.insert(s[right]);
+            maxlen = max(maxlen, right - left + 1);
+        }
+
+        return maxlen;
+    }
+};