发布时间：2015-04-01 16:50:16
//Given a digit string, return all possible letter combinations that the number could represent.////A mapping of digit to letters (just like on the telephone buttons) is given below.////////Input:Digit string "23"//Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].import java..........【阅读全文】
发布时间：2015-04-01 15:58:33
//3Sum Closest Total Accepted: 33841 Total Submissions: 125526 My Submissions Question Solution //Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exa.........【阅读全文】
发布时间：2015-04-01 10:33:26
/Given an integer, convert it to a roman numeral.////Input is guaranteed to be within the range from 1 to 3999.import java.util.HashMap;import java.util.Map;public class IntegertoRoman {public static void main(String[] args) {// TODO 自动生成的方法存根System.out.print(intToRoman(365));}.........【阅读全文】
发布时间：2015-03-31 16:52:28
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I I GY I RAnd then read line by line: "PAHNAPLSIIGYIR"Write the code that.........【阅读全文】
发布时间：2015-03-31 13:06:39
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.注意：写的过程中问题不少 ：穷举是跑不过的。要使用dp ，另外在循环中调用函数效率太低，我们要先把参数保留，.........【阅读全文】
