摘要：
1 /* a good way to predict overflow 2 * each time *10 must predict int overflow 3 * not only the last time to predict which will be wrong. 4 */ 5 clas 阅读全文
posted @ 2016-09-07 22:43
zeroArn
阅读(108)
评论(0)
推荐(0)
摘要：
1 /* simple simulation algorithm 2 * we cann`t make sure the size of the string, 3 * so it had better to storage in vector. 4 * show[] to buffer the new order of the string 5 */ 6 class S... 阅读全文
posted @ 2016-09-07 20:50
zeroArn
阅读(120)
评论(0)
推荐(0)
摘要：
o(n)算法地址:http://blog.163.com/zhaohai_1988/blog/static/2095100852012716105847112//* pivot varies when the size of substrig is even or odd * member function parameter varies according to the size of s... 阅读全文
posted @ 2016-09-07 19:42
zeroArn
阅读(136)
评论(0)
推荐(0)
摘要：
1 ### Letcode 003: Longest Substring Without Repeating Characters 2 ``` 3 /* basic traverse the string 4 * set to predict there is no repeat char in the substring 5 * 6 * Time Limit Out 7 ... 阅读全文
posted @ 2016-09-07 17:14
zeroArn
阅读(139)
评论(0)
推荐(0)
摘要：
//Memory Limit Exceeded /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution ... 阅读全文
posted @ 2016-09-07 15:31
zeroArn
阅读(135)
评论(0)
推荐(0)
浙公网安备 33010602011771号