码迷,mamicode.com
首页 >  
搜索关键字:nexus one    ( 29197个结果
读书笔记 chapter1
-- chapter1. //7.-- Le`s Make a Gmae Using Molehill* Vector3D: containing an x, y, and z component* Normal: a Vector3D that has a length of one* Matri...
分类:其他好文   时间:2014-08-20 19:35:42    阅读次数:227
as3 代码优化之pmd
首先下载com.abobe,ac.pmd.eclipse_...jar 和 flex-pmd-all-in-one...zip俩文件前面一个装在xx\adobe flash builder xx\eclipse\plugins下,后面随便放哪,但路径中不能有空格,解压之。重启fb,再配置下,窗口->...
分类:其他好文   时间:2014-08-20 17:57:22    阅读次数:262
好烦,水题花了那么长时间还做不出来,然后。。。。就没有然后了。。。。
h Jesus! The Minecraft Server of XadillaX's came across a bug!There's one way to solve this bug in game. That is to get a bucket of water and a bucket...
分类:其他好文   时间:2014-08-20 17:48:32    阅读次数:216
ios提交程序后出现的各种问题
提交了几次都被feedback,以下均为本人碰到过得问题,希望对大家解决提交问题有帮助 Number    one:PLA 3.3.12 We found your app uses the iOS Advertising Identifier but does not include ad functionality. This does not comply with the te...
分类:移动开发   时间:2014-08-20 16:28:33    阅读次数:444
POJ 2481 Cows(树状数组)
Description Farmer John's cows have discovered that the clover growing along the ridge of the hill (which we can think of as a one-dimensional number line) in his field is particularly good.  Fa...
分类:其他好文   时间:2014-08-20 14:10:52    阅读次数:225
POJ 3187 Backward Digit Sums(next_permutation)
Description FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to N (1 <= N <= 10) in a certain order and then sum adjacent numbers to produce a new list with one fewer...
分类:其他好文   时间:2014-08-20 10:33:36    阅读次数:256
POJ 3517 And Then There Was One(约瑟夫环-递推or模拟)
POJ 3517 题目: n  k m             数字1到n成环,先叉数字m,往下数k个,直到最后只有一个数字,输出它。 链表模拟: #include #include #include #include #include #include #include #include #include #include #define MAXN ...
分类:其他好文   时间:2014-08-20 10:29:36    阅读次数:212
POJ 3517 And Then There Was One (约瑟夫环问题)
经典的约瑟夫环问题嘛。有点小小的变形而已。给你N个人围成一个环(编号1~N),从第M个人开始,每隔K个人报一次数,报数的人离开该环。 求最后剩下的人的编号。 约瑟夫问题的数学递推解法: (1)第一个被删除的数为 (m - 1) % n。         (2)假设第二轮的开始数字为k,那么这n - 1个数构成的约瑟夫环为k, k + 1, k + 2, k +3, .....,...
分类:其他好文   时间:2014-08-20 00:05:35    阅读次数:258
Reverse Linked List II
Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5...
分类:其他好文   时间:2014-08-19 22:08:15    阅读次数:238
似懂非懂的SynchronousQueue和长度为1的BlockingQueue
阅读ArrayBlockingQueue源码,很容易知道有界阻塞队列的长度至少为1,也就是至少能缓存下一个数据。SynchronousQueue的javadoc文档提到A synchronous queue does not have any internal capacity, not even a capacity of one.也就说同步队列的容量是0,不会缓存数据。 长度为1的阻塞队列和...
分类:其他好文   时间:2014-08-19 20:56:35    阅读次数:298
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!