huyumin
- 浏览: 391621 次
- 性别:
- 来自: 深圳
-
最新评论
-
Nabulio：
写的详细,特殊语法学习到了
jdk1.5-1.9新特性 -
wooddawn：
您好,最近在做个足球数据库系统,用到了betbrain的数据表 ...
javascript深入理解js闭包 -
lwpan：
很受启发 update也可以
mysql 的delete from 子查询限制 -
wuliaolll：
不错,总算找到原因了
mysql 的delete from 子查询限制
文章列表
java算法之希尔排序
- 博客分类：
- 算法
package com.hym.test.algorithms;
public class ShellSort {
private int[] arrayTest = { 5, 26, 1, 783, 23, 2, 62, 9, 46 };
public void shellSort() {
int begin, end;
int temp;
int h = 1;
while (h <= arrayTest.length / 3) {
h = 3 * h + 1;
}
while (h > 0) {
for ...
java算法之归并排序
- 博客分类：
- 算法
package com.hym.test.algorithms;
public class MergeSort {
private int[] arrayTest = { 5, 26, 1, 783, 23, 2, 62, 9, 46 };
public void mergeSort() {
int[] workArray = new int[arrayTest.length];
reMergeSort(workArray, 0, arrayTest.length - 1);
}
public void reMergeSort(int[] workArr ...
java算法之二分查找
- 博客分类：
- 算法
package com.hym.test.algorithms;
public class BinarySerch {
int[] arrayTest = { 1, 2, 5, 9, 23, 26, 46, 62, 783 };
public int searchByCycle(int theFindNum) {
int length = arrayTest.length;
int begin = 0;
int end = length - 1;
while (true) {
int middle = (begin + end) / 2;
...
java算法之插入排序
- 博客分类：
- 算法
package com.hym.test.algorithms;
public class InsertSort {
int[] arrayTest = { 5, 26, 1, 783, 23, 2, 62, 9, 46 };
public void insertSort() {
int in, out;
for (out = 1; out < arrayTest.length; out++) {
int temp = arrayTest[out];
in = out;
while (in > 0 && arr ...
oblige
disturb
vicar
goddess
sacred.[ˈseikrid]
archaeologist.[ˌ ɑ:kɪˈ ɔləd ʒɪst]
promontory
prosperous.[ˈprɔspərəs]
hip
graceful
10
worship
collar
sacrifice.[ˈsækrifais]
privilege
dustman
velvet.[ˈvelvit]
arcade.[ɑ:ˈkeɪd]
blare
raid
ashtray.[ˈæʃˌtreɪ]
20
mutilate.[ˈmju:tlˌeɪt]
chew
fiancé
oven
mon ...
为Oracle数据库创建用户
- 博客分类：
- oracle
Oracle安装完后，其中有一个缺省的数据库，除了这个缺省的数据库外，我们还可以创建自己的数据库。
对于初学者来说，为了避免麻烦，可以用'Database Configuration Assistant'向导来创建数据库。
创建完数据库后，并不能立即在数据库中建表，必须先创建该数据库的用户，并且为该用户指定表空间。
下面是创建数据库用户的具体过程：
1.假如现在已经建好名为'news'的数据库，此时在F:\oracle\product\10.1.0\oradata\目录下已经存在news目录（注意：我的Oracle10g安装在F:\oracle下，若 ...
java算法之选择排序
- 博客分类：
- 算法
package com.hym.test;
public class SelectSort {
int[] arrayTest = { 5, 26, 1, 783, 23, 2, 62, 9, 46 };
public void selectSort() {
for (int i = 0; i < arrayTest.length; i++) {
int theMinNumIndex = i;
for (int j = i; j < arrayTest.length; j++) {
if ((j < arrayTest.leng ...
java算法之冒泡排序
- 博客分类：
- 算法
package com.hym.test;
public class PopSort {
int[] arrayTest = { 5, 26, 1, 783, 23, 2, 62, 9, 46 };
public void sort() {
for (int i = 0; i < arrayTest.length; i++) {
for (int j = 0; j < arrayTest.length - i; j++) {
if ((j + 1 < arrayTest.length)
&& arrayTe ...
package com.hym.test;
public class RecursiveCalNum {
public int calNum(int num, int baseValue) {
num--;
if (num <= 0) {
return baseValue;
} else {
int theValue = baseValue + 2;
return calNum(num, theValue);
}
}
public static void main(String[] args) {
Recursiv ...
linux questions
- 博客分类：
- linux
linux:
1.How do you identify a Java process id in a UNIX machine?
jps
2.How do you get a thread dump of a Java process in a UNIX machine?
jmap
3.If you have multiple java processes running in a UNIX machine, how would you identify a particular process?
pf -ef | grep processid
4.What tools/commands ...
database questions
- 博客分类：
- database
1.Explain inner and outer joins?
2.Explain a sub-query? How does a sub-query impact on performance?
http://blog.csdn.net/AJAXBloger/article/details/1764506
3.What is normalization? When to denormalize?
4.How do you implement one-to-one, one-to-many and many-to-many relationships while designing ta ...
XML questions
- 博客分类：
- java
1.Which is better to store data as elements or as attributes?
2.Why use an XML document as opposed to other types of documents like a text file etc?
3.Explain where your project needed XML documents?
config and transfer data
4.How do you write comments in an XML document?
<!-- 这里写注释-->
5.Ho ...
JMS questions
- 博客分类：
- java
1.Why use JMS? What are the components of the JMS architecture?
JMS有以下元素组成。
JMS提供者
连接面向消息中间件的，JMS接口的一个实现。提供者可以是Java平台的JMS实现，也可以是非Java平台的面向消息中间件的适配器。
JMS客 ...
j2ee questions
- 博客分类：
- java
1.What is Test Driven Development (TDD)?
优点：在任意一个开发节点都可以拿出一个可以使用，含少量bug并具一定功能的产品。
缺点：增加代码量。测试代码是系统代码的两倍或更多。
TDD = TFD + Refactoring
(TFD -- Test First Development)
2.What is the point of Test Driven Development (TDD)? What do you think of TDD
What is aspect oriented programming (AOP)? Do you ...
java questions
- 博客分类：
- java
1."Explain Java class loaders? If you have a class in a package, what do you need to do to run it? Explain dynamic class loading?"
http://blog.csdn.net/duxu2004/article/details/676086
2. Explain static vs. dynamic class loading?
http://blog.csdn.net/chiuan/article/details/7022508
http://bl ...