1.异常:Cannot delete or update a parent row: a
foreign key constraint
fails 解决方案：将MySQL方言修改为org.hibernate.dialect.MySQLInnoDBDialect问题解决
分类：
其他好文 时间：
2014-05-26 10:29:56
阅读次数：
229
用focus设置输入光标的时候，默认情况下，在IE，谷歌浏览器，苹果（safari）浏览器下是在输入框的最前面，在火狐，opera下是在输入框的文字最后面。如果想自己设置，下面有两个jquery的扩展，可供参考。$.fn.focusEnd=function(){
return this.each(f...
分类：
其他好文 时间：
2014-05-26 09:29:06
阅读次数：
219
题目一：
Given a binary tree containing digits from 0-9 only, each root-to-leaf
path could represent a number.
An example is the root-to-leaf path 1->2->3 which represents the number 123.
Fin...
分类：
其他好文 时间：
2014-05-26 04:06:41
阅读次数：
248
题目：2520 is the smallest number that can be
divided by each of the numbers from 1 to 10 without any remainder.What is the
smallest positive number that...
分类：
其他好文 时间：
2014-05-26 02:12:53
阅读次数：
167
-----022-mysql.php ----- 1 2 3 4 5 MySQL 6 7 8
MySQL 9 10 mysql_fetch_row查询数据：", "\n";22 while(list($a, $b, $c) =
mysql_fetch_row($r...
分类：
数据库 时间：
2014-05-25 03:24:55
阅读次数：
281
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have
exact...
分类：
其他好文 时间：
2014-05-25 00:46:51
阅读次数：
229
题目
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
解答...
分类：
其他好文 时间：
2014-05-25 00:37:34
阅读次数：
284
【题目】
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
For example:...
分类：
其他好文 时间：
2014-05-24 20:44:39
阅读次数：
221
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume
that each input would have exact...
分类：
其他好文 时间：
2014-05-24 20:43:37
阅读次数：
341
【题目】
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
Given an integer n, return all distinct solutions to the n-queens puzzle.
Each solution contains a distinct board configuratio...
分类：
其他好文 时间：
2014-05-24 17:12:32
阅读次数：
237
