State machine behaviours are scripts that can be attached to animator states or sub-state machines in an Animator Controller. These can be used to add all sorts of behaviour that is state dependent su...
分类：
编程语言 时间：
2015-03-31 10:58:08
阅读次数：
268
Fragment 相关API getSupportFragmentManager().popBackStack() getFragmentManager().getBackStackEntryCount 其是操作谁的，当一个activity初次显示的时候，其是0还是1. Fragment 具体有几个...
分类：
编程语言 时间：
2015-03-30 18:25:06
阅读次数：
411
yum install ntfs-3gsudo mount -t ntfs-3g /dev/sdc1 /mnt/mobiledisk出现错误：Mount is denied because the NTFS volume is already exclusively opened.The volum...
分类：
移动开发 时间：
2015-03-30 15:59:23
阅读次数：
1263
13861. Pogo-Cow
Constraints
Time Limit: 1 secs, Memory Limit: 256 MB
Description
In an ill-conceived attempt to enhance the mobility of his prize cow Bessie, Farmer John has attached...
分类：
其他好文 时间：
2015-03-30 09:33:59
阅读次数：
192
ThreadLocal只包含一个属性threadLocalHashCode。
public class ThreadLocal {
/**
* ThreadLocals rely on per-thread linear-probe hash maps attached
* to each thread (Thread.threadLocals and...
分类：
其他好文 时间：
2015-03-28 20:27:40
阅读次数：
131
I try to do a testing for HashTable Sychronized behavior today.As an Sychronized Object, HashTable already an Sychronized at put and get function. I w...
分类：
编程语言 时间：
2015-03-22 06:53:36
阅读次数：
150
今天提交代码时，无论怎么弄，重启，clean project都报异常，提交不上去：
org.tigris.subversion.javahl.ClientException: Attempted to lock an already-locked dir
svn: Working copy workspace\WebRoot\' locked
org.tigris.subversion.ja...
分类：
编程语言 时间：
2015-03-21 08:37:32
阅读次数：
249
1. Use memory :In the question, it already stated that there must be a majority element. So discard empty situation.Also it needs the number, not the ...
分类：
其他好文 时间：
2015-03-20 09:11:55
阅读次数：
143
问题如下：mysql>showslavestatus\G***************************1.row***************************Slave_IO_State:Master_Host:172.168.3.190Master_User:slaveMaster_Port:12148Connect_Retry:60Master_Log_File:binlog.000001Read_Master_Log_Pos:753Relay_Log_File:WIN-O..
分类：
数据库 时间：
2015-03-19 11:46:24
阅读次数：
551
This DP is a little bit tricky. You need to clear that:when S[i-1] == T[j-1], it has two part :1. dp[i-1][j-1], this means from 0 - j-1, it already ma...
分类：
其他好文 时间：
2015-03-19 08:50:24
阅读次数：
147
