hyt502的专栏

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. 根据题意，找到给定字符串中最长的回文

题目链接：http://www.lintcode.com/en/problem/first-missing-positive/ Given an unsorted integer array, find the first missing positive integer. Example Given [1,2,0] return 3, and [3,4,-1,1

题目链接：http://www.lintcode.com/en/problem/subarray-sum-closest/ Given an integer array, find a subarray with sum closest to zero. Return the indexes of the first number and last number. Ex