Given an array of non-negative integers, you 
are initially positioned at the first index of the array.Each element in the 
array represents your maximu...
                            
                            
                                分类:
其他好文   时间:
2014-05-26 18:46:20   
                                阅读次数:
251
                             
                    
                        
                            
                            
                                写在前面阅读目录:概念中的理解代码中的实现后记掀起了你的盖头来,让我看你的眼睛,你的眼睛明又亮呀,好像那水波一模样;掀起了你的盖头来,让我看你的脸儿,看看你的脸儿红又圆呀,好像那苹果到秋天。。。 
Hi,Unit Of Work,掀起你的盖头来,原来 You are sobeautiful !概念中....
                            
                            
                                分类:
其他好文   时间:
2014-05-26 16:42:26   
                                阅读次数:
317
                             
                    
                        
                            
                            
                                画一个心形有很多公式可以使用,下面这个公式我认为最完美了:
float x = R * 16 * pow(sin(theta), 3);
float y = R * (13 * cos(theta) - 5*cos(2*theta)	- 2*cos(3*theta) - cos(4*theta));
画出来的心形最漂亮,最原始的笛卡尔的心形是个肥心,没这个好看,呵呵。
效果如下:
...
                            
                            
                                分类:
其他好文   时间:
2014-05-25 22:46:49   
                                阅读次数:
315
                             
                    
                        
                            
                            
                                原文:
Given an array of integers, every element appears twice except for one. Find that single one.
Note:
Your algorithm should have a linear runtime complexity. Could you implement it without ...
                            
                            
                                分类:
其他好文   时间:
2014-05-25 21:30:02   
                                阅读次数:
276
                             
                    
                        
                            
                            
                                增量备份分为差异备份(differential incremental 
backup)和累积备份(cumulative incremental backup),这是两种执行增量备份操作的不同方法。80. You perform 
differential incremental level 1 bac...
                            
                            
                                分类:
其他好文   时间:
2014-05-25 20:03:24   
                                阅读次数:
301
                             
                    
                        
                            
                            
                                HangoverTime Limit: 1000MSMemory Limit: 
10000KTotal Submissions: 99369Accepted: 48162DescriptionHow far can you make a 
stack of cards overhang a tabl....
                            
                            
                                分类:
其他好文   时间:
2014-05-25 18:46:14   
                                阅读次数:
216
                             
                    
                        
                            
                            
                                Problem DescriptionIn your childhood, do you 
crazy for collecting the beautiful cards in the snacks? They said that, for 
example, if you collect all t...
                            
                            
                                分类:
其他好文   时间:
2014-05-25 14:05:37   
                                阅读次数:
214
                             
                    
                        
                            
                            
                                【题目】
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).
You may assume that the intervals were initially sorted according to their start times.
Example 1:
Given intervals [1,3],[6,9], insert and mer...
                            
                            
                                分类:
其他好文   时间:
2014-05-25 12:56:43   
                                阅读次数:
271
                             
                    
                        
                            
                            
                                DescriptionCerror is the mayor of city 
HangZhou. As you may know, the traffic system of this city is so terrible, that 
there are traffic jams everywhe...
                            
                            
                                分类:
其他好文   时间:
2014-05-25 11:40:26   
                                阅读次数:
393
                             
                    
                        
                            
                            
                                Problem Description
Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.
In the field of Cyberground, the ...
                            
                            
                                分类:
其他好文   时间:
2014-05-25 11:13:53   
                                阅读次数:
245