0x6F6F70-CSDN博客

原创 Java集合类

Iterable接口用于返回Iteratorpublic interface Iterable { /** * Returns an iterator over a set of elements of type T. * * @return an Iterator. */ Iterator iterator();}Collect

2014-03-02 13:15:57 531

原创 struts2.0 小结

struts是开源软件。使用Struts的目的是为了帮助我们减少在运用MVC设计模型来开发Web应用的时间。如果我们想混合使用Servlets和JSP的优点来建立可扩展的应用，struts是一个不错的选择。struts2.0 request->filter->xxxAction(struts.xml中配置action对应的class) -> view(struts.xml配

2014-01-28 23:52:32 541

转载在linux下php挂接mysql.so扩展的方法

值得一看 http://www.cnblogs.com/wangtao_20/archive/2011/03/07/1973621.html

2013-12-26 20:15:49 1323

转载 mysql远程访问失败解决方案

mysql远程连接失败的解决方法（CentOS版）（1）先将mysql服务停掉# /etc/init.d/mysqld stop(2)查看mysql配置文件# vi /etc/my.cnf特别要留意其中的两项：bind_address和skip_networking,bind_address一定不能为127.0.0.1，否则只能在本地连接，skip_networking一定不能

2013-12-26 19:27:23 776 1

转载 centos 6.2 安装mysql-5.5.17

任何源码包缺失都可以在google code中下载1.安装相关库文件（没有的话就安装，有就不用安装了） # yum install bison gcc gcc-c++ autoconf automake zlib* libxml* ncurses-devel libtool-ltdl-devel* 2.安装cmake包# wget http://www.c

2013-12-26 19:08:33 672

转载实战Nginx与PHP（FastCGI）的安装、配置与优化

http://ixdba.blog.51cto.com/2895551/806622

2013-12-25 19:10:13 575

原创数据结构基本概念和术语

数据（data）是对客观事物的符号表示。数据元素（data element）是数据的基本单位，由若干个数据项组成例如一本书的书目信息为一个数据元素，而书目中的每一项（书名，作者名等）为一个数据项。数据对象（data object）是性质相同的数据元素的集合，是数据的一个子集数据结构（data structure）

2013-12-11 16:10:28 459

转载 Maven常用命令

Maven常用命令： 1. 创建Maven的普通java项目： mvn archetype:create -DgroupId=packageName -DartifactId=projectName 2. 创建Maven的Web项目： mvn archetype:create -DgroupId=packageName

2013-11-04 08:03:28 569

转载解决编译apache出现的问题：configure: error: APR not found . Please read the documentation

http://xtony.blog.51cto.com/3964396/836508

2013-10-30 20:44:30 514

转载 Linux Tomcat安装

为了学习java，需要一个服务器，因此决定用比较流行的tomcat。根据网上对安装tomcat的介绍，自己进行了安装，现在已经成功了，现在把安装的过程进行记录，也供大家学习参考。一、从官方网站上下载tomcat软件包。 http://tomcat.apache.org/ 点击左侧的 download的一个版本，我选择的是 tomcat6.x,你可以根据自己的实际情况进行

2013-10-30 15:41:48 561

转载 jdk-7u3-linux-i586.tar.gz安装

JDK安装 tar.gz为解压后就可使用的版本，这里我们将jdk-7u3-linux-i586.tar.gz解压到/usr/local/下。1、解压解压到当前目录：$ tar -zxvf /opt/setup/jdk-7-ea-bin-b145-linux-i586-07_jun_2011.tar.gz2、环境配置① $sudo vi /etc/profile② 在末尾行添加

2013-10-30 15:25:01 606

原创（zju3405）Counting Factor Trees

Counting Factor TreesTime Limit: 2 Seconds Memory Limit: 65536 KB Factoring, i.e., listing all the prime factors, of an integer is a useful skill that often helps to solve math problems.

2011-06-18 01:57:00 771

原创位运算之（2）按位异或（xor）^ 操作

按位异或运算俗称：xor运算 1、xor的基本知识我们来看看xor运算的机理： 1001011001011----àaxor 1011010001110----àb-----

2011-06-17 11:33:00 1214

转载位运算之（1）按位与（AND）& 操作

由于位运算直接对内存数据进行操作，不需要转成十进制，因此处理速度非常快。按位与（BitwiseAND），运算符号为&a&b 的操作的结果：a、b中对应位同时为1，则对应结果位也为1、例如：10010001101000101011001111000& 111111

2011-06-17 11:21:00 864

原创 (zju 3403)Strange Calendar III

Strange Calendar IIITime Limit: 2 Seconds Memory Limit: 65536 KB As we know, in the Bzu planet and in the cc98 planet, people use special calendar which is similar to that used in the ear

2011-06-15 22:10:00 378

DescriptionIn this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in ascending order. For the in

2011-05-19 21:01:00 451

原创 (POJ1862)Stripies

DescriptionOur chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian - polosatiki, but the scientists had to invent an English name to apply for an international patent).

2011-05-19 20:51:00 503

原创（POJ1844）Sum

DescriptionConsider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a given sum S the minimum number N for which we

2011-05-19 20:44:00 601

原创（POJ1953）World Cup Noise

Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 11299Accepted: 5591DescriptionBackground"KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their team has reached the semifinals of the FIFA World Cup in their home country. But

2011-05-17 23:42:00 759

原创（POJ2140）Herd Sums

DescriptionThe cows in farmer John's herd are numbered and branded with consecutive integers from 1 to N (1 Farmer John, who majored in mathematics in college and loves numbers, often looks for patterns. He has noticed that when he has exactly 1

2011-05-13 09:40:00 469

转载分治法编程问题之最接近点对问题的算法分析

问题描述 在应用中，常用诸如点、圆等简单的几何对象代表现实世界中的实体。在涉及这些几何对象的问题中，常需要了解其邻域中其他几何对象的信息。例如，在空中交通控制问题中，若将飞机作为空间中移动的一个点来看待，则具有最大碰撞危险的2架飞机，就是这个空间中最接近的一对点。这类问题是计算几何学中研究的基本问题之一。下面我们着重考虑平面上的最接近点对问题。 最接近点对问题的提法是:给定平面上n个点，找其中的一对点，使得在n个点的所有点对中，该点对的距离最

2011-05-03 19:56:00 811

原创 (hdu1010)Tempter of the Bone

Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately

2011-04-28 17:43:00 356

原创（hdu1005）Number Sequence

Problem DescriptionA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n). InputThe input consists of multiple test cases. Each test case contains 3 i

2011-04-28 13:04:00 403

原创（hdu1004）Let the Balloon Rise

Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and fin

2011-04-28 12:26:00 398

原创（hdu1098）Ignatius's puzzle

Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,input a nonegative integer k(k<10000),to find the minimal nonegative integer

2011-04-27 21:05:00 705

原创 (hdu1028)Ignatius and the Princess III

Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The second problem is, given an positive integer N, we define an equation like this: N=a[1]+a[2]+a[3]+...+a[m]; a[i]>0,1My qu

2011-04-27 17:26:00 485

yyrookie的专栏