Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example:Given bi ...
分类：
其他好文 时间：
2016-09-23 06:39:13
阅读次数：
190
1、wait阻塞父进程，没有子进程或SIGCHLD set to SIG_IGN 会失败，until status information for one of the terminated child processes of the calling process is available, o ...
分类：
其他好文 时间：
2016-09-21 21:32:26
阅读次数：
151
我oracle 是安装在linux 下。 ORA-00257: archiver error. Connect internal only, until freed 得知是错误是由于归档日志（archive log）已满引起的。 以下是解决办法： 异常 ORA-00257: archiver err ...
分类：
其他好文 时间：
2016-09-20 16:29:08
阅读次数：
109
There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach ...
分类：
其他好文 时间：
2016-09-20 15:08:22
阅读次数：
140
一、创建一个10G分区，并格式为ext4文件系统；1.创建一个10G的分区：
[root@localhost~]#fdisk/dev/sdb
DevicecontainsneitheravalidDOSpartitiontable,norSun,SGIorOSFdisklabel
BuildinganewDOSdisklabelwithdiskidentifier0x67486aa6.
Changeswillremaininmemoryonly,until..
分类：
其他好文 时间：
2016-09-18 15:47:10
阅读次数：
180
Implement an iterator to flatten a 2d vector. For example,Given 2d vector = By calling next repeatedly until hasNext returns false, the order of eleme ...
分类：
其他好文 时间：
2016-09-16 00:12:25
阅读次数：
235
There are n coins in a line. Two players take turns to take one or two coins from right side until there are no more coins left. The player who take t ...
分类：
其他好文 时间：
2016-09-11 14:09:01
阅读次数：
210
题目： Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is l ...
分类：
其他好文 时间：
2016-09-11 09:00:20
阅读次数：
107
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: ...
分类：
其他好文 时间：
2016-09-11 06:48:43
阅读次数：
146
There is a list of sorted integers from 1 to n. Starting from left to right, remove the first number and every other number afterward until you reach ...
分类：
其他好文 时间：
2016-09-11 01:25:14
阅读次数：
179
