Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possibl...
分类：
其他好文 时间：
2014-08-20 14:06:22
阅读次数：
163
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega...
分类：
其他好文 时间：
2014-08-20 11:57:22
阅读次数：
198
Description
FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 <= N <= 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer...
分类：
其他好文 时间：
2014-08-20 10:33:36
阅读次数：
256
点击打开链接题目链接
Palindrome
Time Limit: 3000MS
Memory Limit: 65536K
Total Submissions: 52910
Accepted: 18248
Description
A palindrome is a symmetrical string, that i...
分类：
其他好文 时间：
2014-08-20 10:29:46
阅读次数：
194
今晚再刷一题，题目如下：Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices o...
分类：
其他好文 时间：
2014-08-20 01:20:15
阅读次数：
197
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Pana...
分类：
其他好文 时间：
2014-08-19 23:57:55
阅读次数：
475
Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (i...
分类：
其他好文 时间：
2014-08-19 23:42:35
阅读次数：
227
Description
A palindrome is a word, number, or phrase that reads the same forwards as backwards. For example, the name "anna" is a palindrome. Numbers can also be palindromes (e.g.
151 or 753357)....
分类：
其他好文 时间：
2014-08-19 12:57:34
阅读次数：
189
Given a collection of numbers, return all possible subclasses. 1 public class Solution { 2 public List> permute(int[] num) { 3 ArrayList...
分类：
其他好文 时间：
2014-08-19 09:22:03
阅读次数：
198
Selection:selection is a trivial problem if the input numbers are sorted. If we use a sorting algorithm having O(nlgn) worst case running time, then t...
分类：
其他好文 时间：
2014-08-19 04:50:43
阅读次数：
200
