DescriptionThere is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a...
分类：
其他好文 时间：
2014-08-01 12:50:41
阅读次数：
285
题目：Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An example is the root-to-leaf path 1->2->3 w....
分类：
编程语言 时间：
2014-08-01 06:57:21
阅读次数：
297
从jquery官网看到的，简单翻译了一下，很常规的几个改善方法：1: 在循环之外添加 （Append Outside of Loops） 比如代码1：代码1清单：$.each( myArray, function( i, item ) { var newListItem = "" + ite...
分类：
Web程序 时间：
2014-08-01 04:40:31
阅读次数：
321
Climbing StairsYou are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct way...
分类：
其他好文 时间：
2014-08-01 04:37:21
阅读次数：
244
Problem Description:
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you ...
分类：
其他好文 时间：
2014-08-01 00:08:50
阅读次数：
274
Populating Next Right Pointers in Each NodeGiven a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLi...
分类：
其他好文 时间：
2014-07-31 23:25:40
阅读次数：
292
Path Sum IIGiven a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tr...
分类：
其他好文 时间：
2014-07-31 23:17:10
阅读次数：
175
Populating Next Right Pointers in Each Node IIFollow up for problem "Populating Next Right Pointers in Each Node".What if the given tree could be any ...
分类：
其他好文 时间：
2014-07-31 23:16:30
阅读次数：
182
/*
?*?@(#)Ping.java????1.2?01/12/13
?*?Connect?to?each?of?a?list?of?hosts?and?measure?the?time?required?to?complete
?*?the?connection.??This?example?uses?a?selector?...
分类：
编程语言 时间：
2014-07-31 21:24:47
阅读次数：
293
Problem Description
Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.
A blockh...
分类：
Web程序 时间：
2014-07-31 21:05:27
阅读次数：
356
