62 (OC) * leetCode force deduction algorithm

1: two numbers

1: two for loops to

2: linked list

Video analytic

 

2: adding two numbers

Two numbers together

 

3. No repeating characters longest substring

Given a string, wherein the length of the longest and does not find the sub-string containing the repeat character, calculates the length of the substring

The longest substring of characters without repeating

 

4. Looking for a median of two ordered arrays

 

Given two ordered arrays of size and nums1 m and n nums2.

 

Please find both the median and orderly array, and requires time complexity of the algorithm is O (log (m + n)).

The median two ordered arrays

 

 

The longest substring palindromic

Given a string s, s to find the longest substring palindromic. You can assume that the maximum length of 1000 s.

 

Example 1:

 

Enter: "babad"
Output: "bab"
Note: "aba" is a valid answer.
Example 2:

 

Enter: "cbbd"
Output: "bb"

 

 Video analytic

Guess you like

Origin www.cnblogs.com/zyzmlc/p/11427906.html