liliechao的博客

Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 click to show spoilers. Note: The input is assumed to be a 32-bit signed integer. Your func

自己写的代码： 参照了： http://blog.youkuaiyun.com/hopeztm/article/details/7932245public char[] preProcess(String s){ int n = s.length(); if(n == 0){ char[] ch1 = new char[2]; c

public class Solution { public String convert(String s, int numRows) { if(numRows == 1) return s; int len = s.length(), k = 0, interval = (numRows<<1)-2; char[]

Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible i

Two Sumpublic static int[] twoSum(int[] numbers, int target) { int[] result = new int[2]; Map<Integer, Integer> map = new HashMap<Integer, Integer>(); for (int i = 0; i < number

Determine whether an integer is a palindrome. Do this without extra space. click to show spoilers. Some hints: Could negative integers be palindromes? (ie, -1) If you are thinking of