WolfgangBai的博客

从这个月开始刷leetcode的题，由于水平有限，欢迎交流和提宝贵的意见。下面是我对 5.Longest Palindromic Substring 的实现。char *longestPalindrome(char *s){ unsigned long len; int count; int start,end; int l,r; int max;

/* 1.Two Sum*/int *twoSum(int *nums, int numsSize, int target){ if (nums == NULL || numsSize <=2) { return NULL; } int i,j; int *p; for (i = 0; i < numsSize; i++) {

/*4 Median of Two Sorted Arrays Beats %96.45*/double findMedianSortedArrays(int* nums1, int nums1Size, int* nums2, int nums2Size){ int mid1,mid2; int i,j,index; if (nums1 == NULL && nums2