![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
LeetCode
Alexhohom
啥都不会ing
展开
-
leetcode 实现28.strStr()
leetcode 实现28.strStr()已战胜99.20%。可以借鉴一下int strStr(string haystack, string needle) { if (needle == "") return 0; int pos_r = 0, pos =-1; for (int i = 0; i < haystack.length(); i++) { if (...原创 2018-10-29 16:30:53 · 206 阅读 · 0 评论 -
LeetCode 557.反转字符串中的单词 III
LeetCode 557.反转字符串中的单词 III超过99%void reverse(int from, int to, string &s){ char temp; to--; for (; from < to; from++) { temp = s[from]; s[from] = s[to]; s[to] = temp; to--; }}s...原创 2018-10-30 11:45:08 · 219 阅读 · 0 评论 -
删除排序数组中的重复项
LeetCode 删除排序数组中的重复项超过98%,仅此记录。#include &lt;vector&gt;#include &lt;iostream&gt;using namespace std;int removeDuplicates(vector&lt;int&gt;&amp; nums) { int pos = 1, last = -1; if (nums.size(原创 2018-11-02 13:34:56 · 158 阅读 · 0 评论 -
LeetCode 压缩字符串
class Solution {public: int compress(vector<char>& chars) { if (chars.size() <= 1) return 1; int pos = 0, pos1 = 0; int lq = 0; do { while (pos1 < chars.size...原创 2019-08-25 22:35:59 · 140 阅读 · 0 评论 -
LeetCode 报数
class Solution {public: string countAndSay(int n) { string strOne = "1"; if (n == 1) return strOne; while (--n >= 1) { int pos = 0, pos1 = 0; string strTemp; do {...原创 2019-08-25 22:37:14 · 196 阅读 · 0 评论 -
最后一个单词的长度
class Solution {public: int lengthOfLastWord(string s) { if ("" == s) return 0; while (*s.rbegin() == ' ') s.erase(--(s.rbegin().base())); auto const pos = s.find_last_of(' ');...原创 2019-08-25 22:38:06 · 143 阅读 · 0 评论 -
增减字符串匹配
class Solution {public: vector<int> diStringMatch(string S) { int max = S.size(), min = 0; vector<int> src(0); if (max <= 0) return src; for (auto it : S) { if ('I...原创 2019-08-25 22:39:04 · 142 阅读 · 0 评论 -
有序数组的平方
class Solution {public: vector<int> sortedSquares(vector<int>& A) { if (A.size() <= 0) return A; if (((*A.begin()) * (*(A.end()-1)) ) <= 0) { int pos = 0, pos1...原创 2019-08-25 22:42:31 · 246 阅读 · 0 评论 -
leetcode 二叉搜索树的范围和
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */clas...原创 2019-09-02 08:53:57 · 163 阅读 · 0 评论