摘要: There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it cost... 阅读全文
posted @ 2014-04-23 10:54 beehard 阅读(138) 评论(0) 推荐(0)
摘要: Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-neg... 阅读全文
posted @ 2014-04-23 08:37 beehard 阅读(134) 评论(0) 推荐(0)
摘要: Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack. Solution: Brute force ... 阅读全文
posted @ 2014-04-23 04:48 beehard 阅读(149) 评论(0) 推荐(0)
摘要: 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 longe... 阅读全文
posted @ 2014-04-23 03:44 beehard 阅读(172) 评论(0) 推荐(0)