![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
String
文章平均质量分 55
lyangpku
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Simplify Path
class Solution {public: void split(vector &docs, string path) { int j = -1; for (int i = 0; i < path.size(); i++) { if (path[i] == '/') { if (原创 2013-01-27 19:26:17 · 334 阅读 · 0 评论 -
[LeetCode] Minimum Window Substring
class Solution {public: string minWindow(string S, string T) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = S.size(); int原创 2013-01-29 20:35:14 · 651 阅读 · 0 评论 -
[LeetCode] Longest Common Prefix
class Solution {public: string longestCommonPrefix(vector &strs) { // Start typing your C/C++ solution below // DO NOT write int main() function if (strs.empty()) return "原创 2013-01-29 11:10:02 · 637 阅读 · 0 评论 -
[LeetCode] Valid Palindrome
class Solution {public: bool isPalindrome(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function vector v; for (int i =原创 2013-01-28 19:29:54 · 377 阅读 · 0 评论 -
[LeetCode] Longest Palindromic Substring - O(n)
#include #include using namespace std;class Solution {public: string longestPalindrome(string s) { // Start typing your C/C++ solution below // DO NOT write int main() functio原创 2013-01-29 16:48:21 · 583 阅读 · 0 评论 -
[LeetCode] Zigzag Conversion
class Solution {public: string convert(string s, int nRows) { // Start typing your C/C++ solution below // DO NOT write int main() function if (nRows == 1) return s;原创 2013-01-29 10:31:18 · 905 阅读 · 0 评论 -
[LeetCode] Anagrams
bool compare(string s1, string s2) { sort(s1.begin(), s1.end()); sort(s2.begin(), s2.end()); return s1 < s2;}bool equal(string s1, string s2) { sort(s1.begin(), s1.end());原创 2013-01-28 17:26:29 · 670 阅读 · 0 评论 -
[LeetCode] Valid Number
class Solution {public: const char *trim_space(const char *s) { while (*s == ' ') s++; return s; } bool isNumber(const char *s) { //原创 2013-01-27 20:25:07 · 411 阅读 · 0 评论 -
[LeetCode] Length of Last Word
class Solution {public: int lengthOfLastWord(const char *s) { // Start typing your C/C++ solution below // DO NOT write int main() function int len = 0; f原创 2013-01-28 04:52:44 · 324 阅读 · 0 评论 -
[LeetCode] Count and Say
class Solution {public: string countAndSay(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector v; vector t;原创 2013-01-28 04:38:39 · 398 阅读 · 0 评论 -
[LeetCode] Multiply Strings
class Solution {public: string multiply(string num1, string num2) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = num1.size();原创 2013-01-28 03:38:27 · 378 阅读 · 0 评论 -
[LeetCode] Regular Expression Matching - Recursively
class Solution {public: bool match(const char *s, const char *p, char ch) { do { if (isMatch(s, p)) return true; } while (*s && (*s++ == ch || ch == '.原创 2013-01-29 19:49:31 · 791 阅读 · 0 评论