- 博客(9)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 cvte 2018 春季实习生招聘 在线测评考点节选（Android ）
1. service生命周期（http://blog.csdn.net/todo_/article/details/51097453）被启动的服务的生命周期：如果一个Service被某个Activity 调用Context.startService 方法启动，那么不管是否有Activity使用bindService绑定或unbindService解除绑定到该Service，该Service都在后台...
2018-03-13 18:30:51
437
原创 sicily-1027. MJ, Nowhere to Hide
1027. MJ, Nowhere to Hide限制条件时间限制: 1 秒, 内存限制: 32 兆 题目描述On BBS, there is a familiar term called MJ (short for MaJia), which means another BBS ID of one person besides his/her main ID.Thes
2016-12-07 21:42:13
272
原创 sicily-1034. Forest
1034. Forest限制条件时间限制: 1 秒, 内存限制: 32 兆 题目描述 In the field of computer science, forest is important and deeply researched , it is a model for many data structures . Now it’s your jo
2016-12-07 21:21:46
252
原创 sicily-1194. Message Flood
1194. Message Flood限制条件时间限制: 1 秒, 内存限制: 32 兆 题目描述Well, how do you feel about mobile phone? Your answer would probably be something like that “It’s so convenient and benefits people a l
2016-12-07 15:23:39
282
原创 sicily-1795. Table tennis
1795. Table tennis限制条件时间限制: 1 秒, 内存限制: 32 兆 题目描述The 49th World Table Tennis Championships was held in Guangzhou from February 24th to March 2nd. It was a chance not to be missed for
2016-11-29 11:50:36
273
原创 sicily-1156. Binary tree
1156. Binary tree限制条件时间限制: 1 秒, 内存限制: 32 兆 题目描述Your task is very simple: Given a binary tree, every node of which contains one upper case character (‘A’ to ‘Z’); you just need to print
2016-11-29 11:01:52
234
原创 sicily-1561. PRIME
1561. PRIME限制条件时间限制: 1 秒, 内存限制: 32 兆 题目描述A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. The first prime number is 2. Can you w
2016-11-23 20:30:37
229
原创 sicily-1443. Printer Queue
1443. Printer Queue限制条件时间限制: 1 秒, 内存限制: 32 兆 题目描述The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs
2016-11-22 11:19:46
298
原创 sicily-1930.排序
1930. 排序Description我们都知道，在排序算法中需要进行多次比较。若比较的两个数Ai, Aj(iAj的话，则称作有效比较。给定一个有N个互异元素的整数序列，请使用选择排序对序列进行排序，并输出其有效比较次数。这里假设使用的是标准的排序算法，并且从下标小到大的顺序进行枚举。比如，给定序列[4,1,3,2]，选择排序的有效比较按顺序有(4,1), (4,3), (
2016-11-22 00:44:27
559
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人