u012462822的专栏

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.Difficulty: Medium分析：寻找字符串中

最近重新捡起算法来看，发现广度优先搜索的代码不是很熟，就在leetcode上搜了一下，找到这道题练练，还是发现了很多问题的。题目描述： Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from begi

leetcode 82. Remove Duplicates from Sorted List IIGiven a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example, Given 1->2

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)).Difficulty: Hard对于两个排序数组，找出中位数

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 “