![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
glory__
世间复合之物必然衰朽,应勤勉修持以求己身之解脱。
展开
-
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, and there exists one unique longest palindromic substring.翻译给定一个字符串S,找出最长的回文子串。你可以假原创 2015-10-19 16:10:57 · 258 阅读 · 0 评论 -
ZigZag Conversion
ZigZag Conversion原创 2015-10-19 19:49:56 · 223 阅读 · 0 评论 -
Longest Substring Without Repeating Characters
题目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 the length is 3. For原创 2015-10-07 23:19:27 · 208 阅读 · 0 评论 -
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)).译文有两个排序数组nums1和nums2,长度分别为m和原创 2015-10-07 23:24:44 · 249 阅读 · 0 评论 -
Two Sum
leetcode原创 2015-10-07 19:22:05 · 222 阅读 · 0 评论 -
Add Two Numbers
leetcode原创 2015-10-07 19:50:03 · 237 阅读 · 0 评论