题目
LeetCode题目如下：
mplement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next() will return the next smallest number in the...
分类：
其他好文 时间：
2015-02-09 21:44:38
阅读次数：
206
#include#include#include#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define pii pair#d...
分类：
其他好文 时间：
2015-02-09 12:26:49
阅读次数：
117
像素密度和屏幕适配本文地址：http://blog.csdn.net/caroline_wendy Android设备的多样性，经常需要根据不同的屏幕进行适配，获得硬件屏幕像素和密度的方式： DisplayMetrics dm = new DisplayMetrics();
getWindowManager().getDefaultDisplay().getMetri...
分类：
移动开发 时间：
2015-02-08 09:02:29
阅读次数：
352
练习1.21这道题几乎没有难度，除非在把书中函数写入到Edwin中时输入错误。(smallest-divisor 199);Value: 199(smallest-divisor 1999);Value: 1999(smallest-divisor 19999);Value: 19999练习1.22...
分类：
其他好文 时间：
2015-02-07 11:39:42
阅读次数：
126
Problem Description
The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 1...
分类：
其他好文 时间：
2015-02-06 21:51:26
阅读次数：
238
uva 10012 How Big Is It?
Ian's going to California, and he has to pack his things, including his collection of circles. Given a set of circles, your program must find the smallest rectangular box...
分类：
其他好文 时间：
2015-02-03 23:11:02
阅读次数：
359
算法入门经典 训练指南 p189#include#include#include#include#includeusing namespace std;struct Item{ int s,b; Item(int s,int b) :s(s),b(b) {} bool operat...
分类：
其他好文 时间：
2015-01-30 17:21:12
阅读次数：
135
Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST.
Calling next() will return the next smallest number in the BST.
Note: next() and...
分类：
其他好文 时间：
2015-01-27 21:58:04
阅读次数：
172
头疼，做道水题。。DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greate...
分类：
其他好文 时间：
2015-01-27 00:12:17
阅读次数：
242
Problem Description
The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and...
分类：
其他好文 时间：
2015-01-26 22:56:41
阅读次数：
202
