- 博客(10)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Observed package id 'build-tools;XX.X.X' in inconsistent location
解决方案： 修改Android SDK目录下，build-tools目录下，寻找对应Android版本号的目录，将其目录名重命名为对应SDK_INT。 例如报错信息为： Observed package id 'build-tools;19.0.0' in inconsistent location 修改 android-sdk-windows\build-tools\android
2017-05-10 09:50:18
7523
原创 【AndroidStudio】小米 DELETE_FAILED_INTERNAL_ERROR
升级AndroidStudio到2.3.1之后，突然无法在小米手机上安装调试应用。 解决方案： 设置-》更多设置-》开发者选项-》启动MIUI优化关闭 重启之后解决。 希望能帮助到各位。
2017-05-02 10:29:13
1727
原创 Microsoft Visual studio 2012 professional 序列号亲测可用
4D974-9QX42-9Y43G-YJ7JG-JDYBP
2014-06-16 14:03:47
1585
转载 Hadoop的日志分析
1). 日志格式分析 首先分析 Hadoop 的日志格式, 日志是一行一条, 日志格式可以依次描述为:日期、时间、级别、相关类和提示信息。如下所示: 2013-03-06 15:23:48,132 INFO org.apache.hadoop.hdfs.server.datanode.DataNode: STARTUP_MSG: /**********************
2014-04-16 19:29:31
1160
原创 Reduce inversion count
时间限制:10000ms 单点时限:1000ms 内存限制:256MB Description Find a pair in an integer array that swapping them would maximally decrease the inversion count of the array. If such a pair exists, retur
2014-04-16 16:12:51
585
原创 String reorder
时间限制:10000ms 单点时限:1000ms 内存限制:256MB Description For this question, your program is required to process an input string containing only ASCII characters between ‘0’ and ‘9’, or between ‘a
2014-04-16 15:43:54
470
原创 K-th string
时间限制:10000ms 单点时限:1000ms 内存限制:256MB Description Consider a string set that each of them consists of {0, 1} only. All strings in the set have the same number of 0s and 1s. Write a program
2014-04-16 15:41:41
572
原创 Longest Repeated Sequence
时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 You are given a sequence of integers, A = a1, a2, ... an. A consecutive subsequence of A (say ai, ai+1 ... aj) is called a "repeated sequence" if i
2014-04-07 15:07:51
494
原创 Arithmetic Expression
时间限制:2000ms 单点时限:200ms 内存限制:256MB 描述 Given N arithmetic expressions, can you tell whose result is closest to 9? 输入 Line 1: N (1 Line 2..N+1: Each line contains an expression in the f
2014-04-07 14:59:56
1202
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人