bool用于判断布尔值的结果是True还是False >>> bool("a") True >>> bool(3) True >>> bool("") False >>> bool(0) False Python中的elif类似于Java中的elseif >>> number...
分类：
编程语言 时间：
2014-08-03 17:41:25
阅读次数：
380
目的：将txt中的数据导入到数据库的一个表中
第一步：scott创建一个空表
create table family(id number(10),name varchar(20),sal number(20),total number(30));
第二步：创建txt数据文件：
vi /oracle/input.txt
1,clark,4000,50000
2,saber,4100,40...
分类：
数据库 时间：
2014-08-03 15:16:45
阅读次数：
236
本文出自：http://blog.csdn.net/svitter
题意分析：
Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear
...
分类：
其他好文 时间：
2014-08-03 12:54:15
阅读次数：
912
Description
You have N integers, A1, A2, ... ,
AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other ...
分类：
其他好文 时间：
2014-08-03 12:53:25
阅读次数：
311
1.包装类除了Void和Character，其他六个全部都继承自Number。Number是一个抽象类。如下：
public abstract class Number implements java.io.Serializable {
public abstract int intValue();
public abstract long longValue();
pu...
分类：
编程语言 时间：
2014-08-03 12:51:35
阅读次数：
307
Consider an infinite full binary search tree (see the figure below), the numbers in the nodes are 1, 2, 3, .... In a subtree whose root node is X, we can get the minimum number in this subtree by repe...
分类：
其他好文 时间：
2014-08-03 12:49:15
阅读次数：
229
题目：Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit i....
分类：
编程语言 时间：
2014-08-03 07:49:34
阅读次数：
246
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.
/**
* Definition for binary tree
...
分类：
其他好文 时间：
2014-08-02 23:32:04
阅读次数：
232
Description
The puzzle game of Sudoku is played on a board of N2 × N2 cells. The cells are grouped in N × N squares of N × N cells each. Each cell is either empty or contains a number between
1 a...
分类：
其他好文 时间：
2014-08-02 23:26:34
阅读次数：
344
