添加之前写的题目

Author: wsz

1.两数之和.cpp

@@ -0,0 +1,35 @@
+// @before-stub-for-debug-begin
+#include <vector>
+#include <string>
+
+using namespace std;
+// @before-stub-for-debug-end
+
+/*
+ * @lc app=leetcode.cn id=1 lang=cpp
+ *
+ * [1] 两数之和
+ */
+#include <bits/stdc++.h>
+using namespace std;
+// @lc code=start
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        unordered_map<int,int> hashTable;
+        vector<int> ans;
+        int n = nums.size();
+        int val;
+        for (int i = 0; i < n; i++)
+        {
+            val = target - nums[i];
+            if (hashTable.count(val))
+                return {i, hashTable[val]};
+            hashTable[nums[i]] = i;
+        }
+        
+        return move(ans);
+    }
+};
+// @lc code=end
+

10.正则表达式匹配.cpp

@@ -0,0 +1,16 @@
+/*
+ * @lc app=leetcode.cn id=10 lang=cpp
+ *
+ * [10] 正则表达式匹配
+ */
+#include <bits/stdc++.h>
+using namespace std;
+// @lc code=start
+class Solution {
+public:
+    bool isMatch(string s, string p) {
+
+    }
+};
+// @lc code=end
+

1143.最长公共子序列.cpp

@@ -0,0 +1,44 @@
+/*
+ * @lc app=leetcode.cn id=1143 lang=cpp
+ *
+ * [1143] 最长公共子序列
+ */
+
+// @lc code=start
+#include <bits/stdc++.h>
+using namespace std;
+class Solution
+{
+public:
+    vector<vector<int>> mem;
+    int dfs(string &s1, string &s2, int a, int b, int &ans, int curLen)
+    {
+        if (s1.size() == a || s2.size() == b)
+        {
+            if (curLen > ans)
+                ans = curLen;
+            return curLen;
+        }
+
+        if (!mem[a][b])
+        {
+            if (s1[a] == s2[b])
+                mem[a + 1][b + 1] = dfs(s1, s2, a + 1, b + 1, ans, curLen + 1);
+            else
+            {
+                mem[a + 1][b] = dfs(s1, s2, a + 1, b, ans, curLen);
+                mem[a][b + 1] = dfs(s1, s2, a, b + 1, ans, curLen);
+            }
+        }
+
+        return mem[a][b];
+    }
+    int longestCommonSubsequence(string text1, string text2)
+    {
+        int ans = 0;
+        mem = vector<vector<int>>(text1.size(), vector<int>(text2.size(), 0));
+        dfs(text1, text2, 0, 0, ans, 0);
+        return ans;
+    }
+};
+// @lc code=end

119.杨辉三角-ii.cpp

@@ -0,0 +1,18 @@
+/*
+ * @lc app=leetcode.cn id=119 lang=cpp
+ *
+ * [119] 杨辉三角 II
+ */
+#include <bits/stdc++.h>
+using namespace std;
+// @lc code=start
+class Solution
+{
+public:
+
+    vector<int> getRow(int rowIndex)
+    {
+
+    }
+};
+// @lc code=end

120.三角形最小路径和.cpp

@@ -0,0 +1,29 @@
+/*
+ * @lc app=leetcode.cn id=120 lang=cpp
+ *
+ * [120] 三角形最小路径和
+ */
+
+#include <bits/stdc++.h>
+using namespace std;
+// @lc code=start
+class Solution
+{
+public:
+    int minimumTotal(vector<vector<int>> &dp)
+    {
+        int n1 = dp.size() - 1,n2,row,nextRow,column;
+        for (row = dp.size() - 2; row >= 0; --row)
+        {
+            nextRow = row + 1;
+            n2 = dp[nextRow].size() - 1;
+
+            for (column = 0; column < n2; ++column)
+            {
+                dp[row][column] = min(dp[nextRow][column], dp[nextRow][column + 1]) + dp[row][column];
+            }
+        }
+        return dp[0][0];
+    }
+};
+// @lc code=end

122.买卖股票的最佳时机-ii.cpp

@@ -0,0 +1,15 @@
+/*
+ * @lc app=leetcode.cn id=122 lang=cpp
+ *
+ * [122] 买卖股票的最佳时机 II
+ */
+
+// @lc code=start
+class Solution {
+public:
+    int maxProfit(vector<int>& prices) {
+
+    }
+};
+// @lc code=end
+

14.最长公共前缀.cpp

@@ -0,0 +1,30 @@
+/*
+ * @lc app=leetcode.cn id=1446 lang=cpp
+ *
+ * [1446] 连续字符
+ */
+#include <bits/stdc++.h>
+using namespace std;
+// @lc code=start
+class Solution
+{
+public:
+    int dfs(string &s, int len){
+        
+    }
+    int maxPower(string s)
+    {
+        int n = s.size();
+        vector<int> dp(n + 1, 1);
+        --n;
+        for (int i = 0; i < n; ++i)
+        {
+            if (s[i] == s[i + 1])
+                dp[i + 1] = dp[i] + 1;
+            if (dp[i + 1] > dp[n])
+                dp[n] = dp[i + 1];
+        }
+        return dp[n];
+    }
+};
+// @lc code=end

1446.连续字符.cpp

@@ -0,0 +1,46 @@
+/*
+ * @lc app=leetcode.cn id=15 lang=cpp
+ *
+ * [15] 三数之和
+ */
+#include <bits/stdc++.h>
+using namespace std;
+// @lc code=start
+class Solution
+{
+public:
+    vector<vector<int>> threeSum(vector<int> &nums)
+    {
+        int n = nums.size(), t, l, r, s;
+        vector<vector<int>> ans;
+        sort(nums.begin(), nums.end());
+        for (int i = 0; i < n; ++i)
+        {
+            t = -nums[i];
+            l = i + 1;
+            r = n - 1;
+            while (l < r)
+            {
+                s = nums[l] + nums[r];
+                if (s > t)
+                    --r;
+                else if (s < t)
+                    ++l;
+                else
+                {
+                    ans.emplace_back(vector{nums[i], nums[l], nums[r]});
+                    
+                    while (l < r && nums[l] == ans.back()[1])
+                        ++l;
+                    while (l < r && nums[r] == ans.back()[2])
+                        --r;
+                }
+            }
+            while (i + 1 < n && nums[i] == nums[i + 1])
+                ++i;
+        }
+
+        return move(ans);
+    }
+};
+// @lc code=end

15.三数之和.cpp

@@ -0,0 +1,30 @@
+/*
+ * @lc app=leetcode.cn id=151 lang=cpp
+ *
+ * [151] 翻转字符串里的单词
+ */
+#include <bits/stdc++.h>
+using namespace std;
+// @lc code=start
+class Solution
+{
+public:
+    string reverseWords(string s)
+    {
+        int n = s.size();
+        int l = 0, r = n - 1;
+
+        while (s[l] == ' ')
+            ++l;
+        while (s[r] == ' ')
+            --r;
+        string ans(r - l + 1, 0);
+        int cur = 0;
+        while (l <= r)
+        {
+            
+        }
+        return move(ans);
+    }
+};
+// @lc code=end

151.翻转字符串里的单词.cpp

@@ -0,0 +1,27 @@
+/*
+ * @lc app=leetcode.cn id=1816 lang=cpp
+ *
+ * [1816] 截断句子
+ */
+#include <bits/stdc++.h>
+using namespace std;
+// @lc code=start
+class Solution {
+public:
+    string truncateSentence(string s, int k) {
+        istringstream in(s);
+        ostringstream out;
+        string word;
+        while(!(in>>word).eof() && k){
+            if (k)
+                out << word << " ";
+            else
+                out << word;
+            --k;
+        }
+        
+        return out.str();
+    }
+};
+// @lc code=end
+

1816.截断句子.cpp

@@ -0,0 +1,15 @@
+/*
+ * @lc app=leetcode.cn id=198 lang=cpp
+ *
+ * [198] 打家劫舍
+ */
+
+// @lc code=start
+class Solution {
+public:
+    int rob(vector<int>& nums) {
+
+    }
+};
+// @lc code=end
+