码迷,mamicode.com
首页 >  
搜索关键字:can    ( 23056个结果
Ignatius and the Princess IV 水
B - Ignatius and the Princess IV Time Limit:1000MS     Memory Limit:32767KB     64bit IO Format:%I64d & %I64u Submit Status Description "OK, you are not too bad, em... But you can neve...
分类:其他好文   时间:2015-08-08 18:17:41    阅读次数:120
LeetCode(70)题解: climbing-stairs
https://leetcode.com/problems/climbing-stairs/题目:You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or...
分类:其他好文   时间:2015-08-08 16:13:47    阅读次数:62
[LeetCode] Strobogrammatic Number II
This problem can be solved easily once you find the regularities :-) This link has done it for you. You may refer to its Python version. I rewrite it ...
分类:其他好文   时间:2015-08-08 16:09:29    阅读次数:994
STM32F4: Generating parallel signals with the FSMC
STM32F4: Generating parallel signals with the FSMCThe goal:The memory controller can be used to generate a "generic" 16-bit parallel data stream with ...
分类:其他好文   时间:2015-08-08 14:53:56    阅读次数:356
第一百二十七天 how can I 坚持
今天请了一天假,在家鼓捣了一天网页,最后还碰了一鼻子灰啊。 哎。 傍晚下了好大的一场雨,被困在桥下边了。 是该放弃的时候了嘛,感觉以我的性格这时候就该放弃了。可是。。 愁人啊。 HTML5 audio。 或许我是真的不会谈恋爱啊。纠结啊。世俗。 啦 拉拉。啦啦啦 啦啦啦啦啦啦啦啦...
分类:其他好文   时间:2015-08-08 01:14:10    阅读次数:149
[翻译] PNChart
PNCharthttps://github.com/kevinzhow/PNChartYou can also find swift version at herehttps://github.com/kevinzhow/PNChart-SwiftA simple and beautiful cha...
分类:其他好文   时间:2015-08-07 23:48:40    阅读次数:565
PAT 1028. List Sorting (25)
1028. List Sorting (25)Excel can sort records according to any column. Now you are supposed to imitate this function.InputEach input file contains one...
分类:其他好文   时间:2015-08-07 22:15:57    阅读次数:115
linux mysql errorcode 29
sudo aa-status If mysqld is included in enforce mode ?when AppArmor blocks the writes/accesses. What you can do is edit /etc/apparmor.d/usr.sbin.mysqld near the bottom like so: ... /usr/sbin/mysq...
分类:数据库   时间:2015-08-07 20:30:58    阅读次数:181
Num 23 : HDOJ : 2199 Can you solve this equation? + HDOJ : 1969 Pie [ 二分法 ]
在处理计算数学上某函数零点的时候,我们通常是这样做的:         1. 先判断这个零点在某个单调区间 [ a,b ]上( 假设为递增区间 );         2. 之后判断 f(x) 在 (a+b)/2 [ a,b中点处 ]是否为零;         3. 若中点处大于零,b=( a+b )/2 ;否则,同理,a=( a+b )/2 ;         4. 重复2.3.过程,直到...
分类:其他好文   时间:2015-08-07 20:21:17    阅读次数:132
[leetcode 239]Sliding Window Maximum
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window...
分类:Windows程序   时间:2015-08-07 20:14:01    阅读次数:208
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!