leecode
guyus
这个作者很懒,什么都没留下…
展开
-
最长未重复子串
class Solution {public: int lengthOfLongestSubstring(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function int locs[256];//保存字符上一次出现的位置转载 2014-07-23 13:46:28 · 299 阅读 · 0 评论 -
atoi 自己实现 leecode
#include #include #include #include #include class Solution {public: int atoi(const char *str) { long long total = 0; while (isspace(*str)) str++; int c =原创 2014-07-24 00:47:34 · 378 阅读 · 0 评论 -
Merge Intervals 练习vector
bool cmp(const Interval &m,const Interval &n) { return m.start < n.start; }class Solution {public: vector merge(vector &intervals) { vector result; if (原创 2014-07-24 21:58:17 · 393 阅读 · 0 评论 -
Merge sort array
//从后往前扫描,不用另开数组class Solution {public: void merge(int A[], int m, int B[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int index转载 2014-07-25 18:50:31 · 346 阅读 · 0 评论