摘要:        
Description:Count the number of prime numbers less than a non-negative number, n 提示晒数法:http://en.wikipedia.org/wiki/Sieve_of_Eratostheneshttps://p...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(120)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Remove all elements from a linked list of integers that have valueval.ExampleGiven: 1 --> 2 --> 6 --> 3 --> 4 --> 5 --> 6, val = 6Return: 1 --> 2 --...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(104)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive intege...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(194)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Climbing Stairs You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(94)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occ...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(126)
评论(0)
推荐(0)
        
            
        
        
摘要:        
今天看了一个华为西安研究院的一个女生代码大神的总结很有感悟,下面这句话送给大家:只有好的程序员才能写出人类可以理解的代码You are a professional robber planning to rob houses along a street. Each house ha...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(158)
评论(0)
推荐(0)
        
            
        
        
摘要:        
实现效果:这个其实是一个非常常见的功能,大家都会考虑给自己简单的工程做一个背景界面。其实只要在view类中重载OnEraseBkgnd()这个函数就好了。代码如下:BOOL CdddView::OnEraseBkgnd(CDC* pDC){ // TODO: 在此添加消息处理程...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(728)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Reverse bits of a given 32 bits unsigned integer.For example, given input 43261596 (represented in binary as 00000010100101000001111010011100)...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(123)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(129)
评论(0)
推荐(0)
        
            
        
        
摘要:        
Given an integer n, return the number of trailing zeroes in n!.Note: Your solution should be in logarithmic time complexity.解决思路: 决定阶乘末尾零的个数其实...    阅读全文
posted @ 2017-11-17 22:28
wangyaning
阅读(125)
评论(0)
推荐(0)
        
                    
                
浙公网安备 33010602011771号