- 博客(4)
- 资源 (2)
- 收藏
- 关注
原创 LeetCode 5. Longest Palindromic Substring
DescriptionGiven a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.
2017-11-15 14:03:02 233
原创 LeetCode 算法第四题
DescriptionThere 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)).
2017-11-14 10:36:40 338
原创 LeetCode算法第三题
DescriptionGiven 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 “b“
2017-11-10 15:12:31 282
原创 LeetCode算法第二题 "add two sums"
DescriptionYou are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers an
2017-11-09 16:10:28 281
264学习总结
2016-10-09
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人