add code

Author: ncdhz

code/1668.最大重复子字符串.cpp

@@ -0,0 +1,43 @@
+#include <string>
+#include <algorithm>
+using namespace std;
+/*
+ * @lc app=leetcode.cn id=1668 lang=cpp
+ *
+ * [1668] 最大重复子字符串
+ */
+
+// @lc code=start
+class Solution {
+public:
+ int maxRepeating(string sequence, string word) {
+ if (sequence.size() < word.size()) {
+ return 0;
+ }
+ int rM = 0;
+ int r = 0;
+ 
+ for (int k = 0; k < sequence.size() - word.size() + 1; k++){
+ for (int i = k; i < sequence.size() - word.size() + 1; i++) {
+ bool isS = true;
+ for (int j = 0; j < word.size(); j++) {
+ if (sequence[i + j] != word[j]) {
+ isS = false;
+ break;
+ }
+ }
+ if (isS) {
+ r++;
+ i += word.size() - 1;
+ } else {
+ break;
+ }
+ }
+ rM = max(rM, r);
+ r = 0;
+ }
+ return rM;
+ }
+};
+// @lc code=end
+

code/1684.统计一致字符串的数目.cpp

@@ -0,0 +1,38 @@
+/*
+ * @lc app=leetcode.cn id=1684 lang=cpp
+ *
+ * [1684] 统计一致字符串的数目
+ */
+#include <set>
+#include <string>
+#include <vector>
+using namespace std;
+
+// @lc code=start
+class Solution {
+public:
+ int countConsistentStrings(string allowed, vector<string>& words) {
+ set<char> s;
+ for (size_t i = 0; i < allowed.size(); i++) {
+ s.insert(allowed[i]);
+ }
+ 
+ int sum = 0;
+
+ for (size_t i = 0; i < words.size(); i++) {
+ bool is_ok = true;
+ for (size_t j = 0; j < words[i].size(); j++) {
+ if (s.count(words[i][j]) == 0) {
+ is_ok = false;
+ break;
+ }
+ }
+ if (is_ok) {
+ sum++;
+ } 
+ }
+ return sum;
+ }
+};
+// @lc code=end
+

code/816.模糊坐标.cpp

@@ -0,0 +1,66 @@
+/*
+ * @lc app=leetcode.cn id=816 lang=cpp
+ *
+ * [816] 模糊坐标
+ */
+#include <vector>
+#include <string>
+using namespace std;
+// @lc code=start
+class Solution {
+private:
+ vector<string> rs;
+
+ bool checkDigit(string s, int i) {
+ if (s.size() != 1) {
+ if (s[0] == '0' && i != 1) {
+ return false;
+ }
+ if (i != 0 && s[s.size() - 1] == '0') {
+ return false;
+ }
+ }
+ return true;
+ }
+
+ string makeStr(string a, string b) {
+ return "(" + a + ", " + b + ")";
+ }
+
+ string genStr(string a, int i) {
+ if (i == 0) {
+ return a;
+ }
+ return a.substr(0, i) + "." + a.substr(i, a.size());
+ }
+
+ void aC(string s, int i) {
+ if (i >= s.size()) {
+ return;
+ }
+ string a = s.substr(0, i);
+ string b = s.substr(i, s.size() - i);
+
+ for(int i = 0; i < a.size(); i++) {
+ string s1 = genStr(a, i);
+ if (checkDigit(s1, i)) {
+ for (size_t j = 0; j < b.size(); j++) {
+ string s2 = genStr(b, j);
+ if (checkDigit(s2, j)) {
+ rs.push_back(makeStr(s1, s2));
+ }
+ }
+ 
+ }
+ }
+ aC(s, i + 1);
+ }
+public:
+ vector<string> ambiguousCoordinates(string s) {
+ rs.clear();
+ aC(s.substr(1, s.size() - 2), 1);
+ return rs;
+ }
+};
+// @lc code=end
+