题目:Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the tw....
分类：
编程语言 时间：
2014-07-22 22:47:33
阅读次数：
256
oracle 主键自动增长这几天搞Oracle，想让表的主键实现自动增长，查网络实现如下：create table simon_example( id number(4) not null primary key, name varchar2(25))-- 建立序列：-- Create sequen...
分类：
数据库 时间：
2014-07-22 22:42:53
阅读次数：
228
题目：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 integ....
分类：
编程语言 时间：
2014-07-22 22:42:33
阅读次数：
218
Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol...
分类：
其他好文 时间：
2014-07-22 22:37:33
阅读次数：
191
A strange liftDescriptionThere is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 2 #include 3 #include 4....
分类：
Web程序 时间：
2014-07-22 22:36:54
阅读次数：
329
Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o...
分类：
其他好文 时间：
2014-07-22 22:35:53
阅读次数：
230
官网FAQ里查到以下说明：“You may find that not all of these icons are used on your system. This is because the number of overlays allowed by Windows is limited.....
分类：
其他好文 时间：
2014-07-22 22:35:16
阅读次数：
600
2^x mod n = 1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11542 Accepted Submission(s): 3577
Problem Description
Give a number n, find...
分类：
其他好文 时间：
2014-07-22 14:03:23
阅读次数：
261
直接套KMP模板
#include
#include
#include
using namespace std;
int s[1000005],w[10005],next[10005];
int b,c;
void show()
{
int i,j;
i=0;
next[0]=-1;
j=-1;
while(i<c)
{
if(j=...
分类：
其他好文 时间：
2014-07-21 23:29:03
阅读次数：
334
Description
The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points ...
分类：
其他好文 时间：
2014-07-21 22:11:18
阅读次数：
289
