wpxiaoxue的专栏

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)).首先想到的是最笨的方法，将两个数组拼接在一起，然后排序，取中

leetcode java 实现3 Longest Substring Without Repeating Characterspublic class Solution { public int lengthOfLongestSubstring(String s) { int i = 0, j = 0; int maxlength = 0;

先制作原字符串的对称镜像字符串，如s = “abcd”, 镜像a = “abcddcba”+” “。 然后对新字符串a，按KMP算法求next的方法，求next, public class Solution { public String shortestPalindrome(String s) { if(s.length() == 0||s.length() ==