kunrong的博客

class Solution { public String longestPalindrome(String s) { if (s == null || s.length() == 0) { return ""; } int length = s.length(); int max = 0;

**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, 3]nums