
LintCode
文章平均质量分 82
zshouyi
这个作者很懒,什么都没留下…
展开
-
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. Have you met this question in a real interview? Yes Example原创 2017-07-01 02:27:31 · 393 阅读 · 0 评论 -
Longest Palindromic Substring
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. Have you met t原创 2017-07-02 01:40:57 · 339 阅读 · 0 评论