update string

Author: dansen

map/leetcode/leetcode-string.txt

@@ -18,17 +18,19 @@
 1737 1759 1781 1807 1813 1839 1849 1850 1904 1910 1915 1946 5714
 
 [-复杂题]
-44 65 68 72 76 87 97 115 126 214 273 336 564 591 632 730 736 761 770 899 936 
+68 72 76 87 97 115 126 214 273 336 564 591 632 730 736 761 770 899 936 
 1096 1106 1163 1316 1392 1449 1531 1542 1585 1745 1830 1948
 
 [-字符串与哈希]
 30
 
 [-字符串与数字]
 415(key=字符串相加)
+65(key=带e字符串转浮点数)
 
 [-字符串匹配]
 28(key=实现strStr函数)
+44(key=通配符匹配)
 
 [-模拟题]
 13 14 38 58 67 383 387 434 520

user/leetcode/44.通配符匹配.cpp

@@ -0,0 +1,15 @@
+/*
+ * @lc app=leetcode.cn id=44 lang=cpp
+ *
+ * [44] 通配符匹配
+ */
+
+// @lc code=start
+class Solution {
+public:
+    bool isMatch(string s, string p) {
+
+    }
+};
+// @lc code=end
+

user/leetcode/65.有效数字.cpp

@@ -0,0 +1,15 @@
+/*
+ * @lc app=leetcode.cn id=65 lang=cpp
+ *
+ * [65] 有效数字
+ */
+
+// @lc code=start
+class Solution {
+public:
+    bool isNumber(string s) {
+
+    }
+};
+// @lc code=end
+

user/leetcode/68.文本左右对齐.cpp

@@ -0,0 +1,15 @@
+/*
+ * @lc app=leetcode.cn id=68 lang=cpp
+ *
+ * [68] 文本左右对齐
+ */
+
+// @lc code=start
+class Solution {
+public:
+    vector<string> fullJustify(vector<string>& words, int maxWidth) {
+
+    }
+};
+// @lc code=end
+