![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
Main Theme
这个作者很懒,什么都没留下…
展开
-
3. Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "原创 2017-09-20 10:44:28 · 257 阅读 · 0 评论 -
4. Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). Example 1: nums1 = [1,原创 2017-09-20 18:36:41 · 193 阅读 · 0 评论 -
5、Longest Palindromic Substring
Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Input: "babad" Output: "bab" Note: "aba" is also a valid answer.原创 2017-09-23 22:03:21 · 195 阅读 · 0 评论 -
c++链表
【c/c++】单链表、头指针、头结点、首元节点 转载地址:http://blog.csdn.net/lzm18064126848/article/details/50819574 链表中第一个结点的存储位置叫做头指针,那么整个链表的存取就必须是从头指针开始进行了。之后的每一个结点,其实就是上一个的后继指针指向的位置。 这里有个地方要注意,就是对头指针概念的理解,这个很重要转载 2017-10-25 19:29:47 · 3920 阅读 · 0 评论