====================问题描述==================== packagecom.example.one_listview; importjava.util.ArrayList;
importjava.util.HashMap;
importjava.util.List...
分类：
其他好文 时间：
2014-10-08 16:40:55
阅读次数：
176
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->3->4->5->NULL, m = 2 and n =
4,
return 1->4->3->2->5->NULL.
Note:
Given m, n satisfy t...
分类：
其他好文 时间：
2014-10-08 15:33:25
阅读次数：
154
思路：利用排列思想，进行递归；#include "iostream"using namespace std;char b[10];void pick_one(char a[],int num[],int n){ if(n==6){ b[n]='\0'; co...
分类：
其他好文 时间：
2014-10-08 15:25:55
阅读次数：
212
问题： Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime co...
分类：
其他好文 时间：
2014-10-07 18:14:13
阅读次数：
189
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类：
其他好文 时间：
2014-10-07 00:32:12
阅读次数：
237
Problem Description
Coach Pang has a lot of hobbies. One of them is playing with “tag soup” with the help of Beautiful Soup. Coach Pang is satisfied with Beautiful Soup in every respect, except t...
分类：
其他好文 时间：
2014-10-06 23:52:41
阅读次数：
237
For built-in types, there are conditional operators (, ==, etc.) that compare values and determine when one is greater than, less than, or equal to an...
分类：
其他好文 时间：
2014-10-06 15:56:40
阅读次数：
176
//Given a non-negative number represented as an array of digits, plus one to the number.
//The digits are stored such that the most significant digit is at the head of the list.
//digits={9,9,9,...
分类：
其他好文 时间：
2014-10-06 13:46:10
阅读次数：
200
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal...
分类：
其他好文 时间：
2014-10-06 13:11:00
阅读次数：
167
DescriptionThere are N cities and N-1 roads in Magic-Island. You can go from one city to any other. One road only connects two cities. One day, The ki...
分类：
其他好文 时间：
2014-10-06 02:45:19
阅读次数：
292
