使用NGUI时偶尔会遇到以下两个报错：Supplied NxActorDesc is not valid. createActor returns NULL. 以及 Actor::updateMassFromShapes: Can't compute mass from shapes: must have at least one non-trigger shape! 如果在NGUI中遇到了物理引擎的报错，或者UICamera没感知到触屏，则检查一下各个BoxCollder的尺寸是否正常。这个尺寸会受到多个...
分类：
其他好文 时间：
2015-02-06 13:14:40
阅读次数：
154
http://docs.oracle.com/cd/E11882_01/server.112/e41084/functions069.htm#i77473http://docs.oracle.com/cd/E11882_01/server.112/e41084/functions087.htm#i77700这两个函数是是一对相反的函数，语法分别为：他们都通过第一个expr的字符类型确定返回值的数据类型。如果第一..
分类：
数据库 时间：
2015-02-05 11:34:22
阅读次数：
164
There are N children standing in a line. Each child is assigned a rating value.
You are giving candies to these children subjected to the following requirements:
Each child must have at least on...
分类：
其他好文 时间：
2015-02-04 14:36:41
阅读次数：
204
Large-scale Parallel Collaborative Filtering for the Netflix Prizehttp://www.hpl.hp.com/personal/Robert_Schreiber/papers/2008%20AAIM%20Netflix/netflix...
分类：
其他好文 时间：
2015-02-03 01:50:38
阅读次数：
1017
Find the contiguous subarray within an array (containing at least onenumber) which has the largest sum.
For example, given the array [?2,1,?3,4,?1,2,1,?5,4],
the contiguous subarray [4,?1,2,1] has t...
分类：
其他好文 时间：
2015-02-02 23:16:28
阅读次数：
368
Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the valu...
分类：
系统相关 时间：
2015-01-31 17:43:36
阅读次数：
158
题目Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations:getandset.get(key)- Get the va...
分类：
系统相关 时间：
2015-01-30 17:19:54
阅读次数：
162
mongodb固定集合(Capped Collection)和大文件管理(GridFS)Capped Collection固定集合(Capped Collection)是性能出色的有着固定大小的集合,以LRU(Least Recently Used最近最少使用)规则和插入顺序进行age-out(老化...
分类：
数据库 时间：
2015-01-28 15:57:19
阅读次数：
200
设置环境变量set ANDROID_HOME=C:\\android-sdk-windowsset PATH=%PATH%;%ANDROID_HOME%\tools;%ANDROID_HOME%\platform-toolshttp://spring.io/guides/gs/android/
分类：
移动开发 时间：
2015-01-28 12:34:54
阅读次数：
163
【题目】
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [?2,1,?3,4,?1,2,1,?5,4],
the contiguous subarray [4,...
分类：
其他好文 时间：
2015-01-27 21:59:43
阅读次数：
145
