Problem Description
Eddy's company publishes a kind of lottery.This set of lottery which are numbered 1 to n, and a set of one of each is required for a prize .With one number per lottery, how many...
分类：
其他好文 时间：
2015-02-06 09:35:12
阅读次数：
140
Given string A representative a positive integer which has N digits, remove any k digits of the number, the remaining digits are arranged according to...
分类：
其他好文 时间：
2015-02-06 07:03:23
阅读次数：
161
Given an arraySofnintegers, find three integers inSsuch that the sum is closest to a given number, target. Return the sum of the three integers. You m...
分类：
其他好文 时间：
2015-02-06 00:34:29
阅读次数：
207
2015.2.5//union//联合体中的成员变量共用的是同一块内存//union Unit//{// char ch[9];// short a;// int amount;// float price;// long number;//};////////struct Goods{/...
分类：
移动开发 时间：
2015-02-05 21:49:48
阅读次数：
263
约束:
一、创建表时，定义约束
create table emp2(
id number(10) constraint emp2_id_nn not null,
name varchar2(20) not null,
salary number(10,2)...
分类：
数据库 时间：
2015-02-05 20:34:54
阅读次数：
154
The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The f...
分类：
编程语言 时间：
2015-02-05 20:02:02
阅读次数：
181
先前初学了《大话数据结构》，然后在网上看到了LeetCode的测试，于是开始刷题，第一题就是排行榜首位Given an array of integers, find two numbers such that they add up to a specific target number.The....
分类：
其他好文 时间：
2015-02-05 20:00:13
阅读次数：
362
Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
难度系数：
容易
实现
int maxDepth(Tr...
分类：
其他好文 时间：
2015-02-05 16:28:31
阅读次数：
119
Given a string S and a string T, count the number of distinct subsequences of T in S.A subsequence of a string is a new string which is formed from the original string by deleting some (can be none) o...
分类：
其他好文 时间：
2015-02-05 15:05:47
阅读次数：
168
Tram
Time Limit: 1000MS
Memory Limit: 30000K
Total Submissions: 10622
Accepted: 3877
Description
Tram network in Zagreb consists of a number of intersections and rails ...
分类：
其他好文 时间：
2015-02-05 14:59:17
阅读次数：
143
