本文在
http://www.cnblogs.com/darrenji/p/3606703.html（感谢博主的分享）基础上加入全国各省市，从文件中读取全国省市县，组成省市联动的选择标签在Model里定义Province
和 City public class Province ...
分类：
Web程序 时间：
2014-05-26 00:30:22
阅读次数：
596
这篇文章主要介绍Shell脚本编写俄罗斯方块的方法，原文来自脚本之家，http://www.jb51.net/article/48926.htm效果图：代码：#!/bin/bash#
Tetris Game# 10.21.2003 xhchen#APP declarationAPP_NAME="${...
分类：
其他好文 时间：
2014-05-25 22:25:03
阅读次数：
352
【题目大意】有一个4x4规格的一个棋盘，现在有16个一面黑一面白的棋子分布在这个棋盘上。翻转一个棋子能够使它以及它上下左右的四个棋子从黑变白，从白变黑。现在问你至少要经过多少次操作才能够使得整个棋盘的颜色相同。【分析】考虑到是4x4的规模，想到用BFS枚举+判重。注意题目的内存限制是64MB，如果普...
分类：
其他好文 时间：
2014-05-25 20:41:18
阅读次数：
246
Problem Description
Teacher HU and his 40 students were trapped by the brigands. To show their power, the head of the brigands want to select one people to kill.
Teacher HU and his 40 students wil...
分类：
其他好文 时间：
2014-05-25 18:19:44
阅读次数：
306
DescriptionCerror is the mayor of city
HangZhou. As you may know, the traffic system of this city is so terrible, that
there are traffic jams everywhe...
分类：
其他好文 时间：
2014-05-25 11:40:26
阅读次数：
393
Problem Description
Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the ...
分类：
其他好文 时间：
2014-05-25 11:13:53
阅读次数：
245
Problem Description
Teacher HU and his 40 students were trapped by the brigands. To show their power, the head of the brigands want to select one people to kill.
Teacher HU and his 40 students wil...
分类：
其他好文 时间：
2014-05-25 10:02:35
阅读次数：
309
Flip GameDescriptionFlip game is played on a
rectangular 4x4 field with two-sided pieces placed on each of its 16 squares.
One side of each piece is w...
分类：
其他好文 时间：
2014-05-25 03:21:52
阅读次数：
255
问题 K: Traveling
时间限制: 1 Sec 内存限制: 128 MB
提交: 13 解决: 4
[提交][状态][论坛]
题目描述
SH likes traveling around the world. When he arrives at a city, he will ask the staff about the number of cities that...
分类：
其他好文 时间：
2014-05-25 01:44:43
阅读次数：
391
之所以说leetcode的测试用例有问题，是因为我刚开始理解错了题意，写下了如下的错误的代码。但是却AC了。
错误代码为：
bool canJump(int A[], int n) {
if(n == 0) return true;
int sum = 0; //记录当前的最远距离
int i = 0;
...
分类：
其他好文 时间：
2014-05-24 19:45:57
阅读次数：
1081
