![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Leetcode
Mark__Zeng
这个作者很懒,什么都没留下…
展开
-
[Leetcode]3. Longest Substring Without Repeating Characters
Proble description: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which t原创 2016-01-03 17:18:25 · 425 阅读 · 0 评论 -
[解题报告]376. Wiggle Subsequence
Problem Background:A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one原创 2016-07-31 15:59:23 · 909 阅读 · 1 评论