正文内容加载中...
posted @ 2017-11-17 22:28 wangyaning 阅读(85) 评论(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 阅读(44) 评论(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 阅读(56) 评论(0) 推荐(0) 编辑
摘要:今天看了一个华为西安研究院的一个女生代码大神的总结很有感悟,下面这句话送给大家:只有好的程序员才能写出人类可以理解的代码You are a professional robber planning to rob houses along a street. Each house ha... 阅读全文
posted @ 2017-11-17 22:28 wangyaning 阅读(105) 评论(0) 推荐(0) 编辑
摘要:实现效果:这个其实是一个非常常见的功能,大家都会考虑给自己简单的工程做一个背景界面。其实只要在view类中重载OnEraseBkgnd()这个函数就好了。代码如下:BOOL CdddView::OnEraseBkgnd(CDC* pDC){ // TODO: 在此添加消息处理程... 阅读全文
posted @ 2017-11-17 22:28 wangyaning 阅读(542) 评论(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 阅读(62) 评论(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 阅读(82) 评论(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 阅读(76) 评论(0) 推荐(0) 编辑
摘要:Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume t... 阅读全文
posted @ 2017-11-17 22:28 wangyaning 阅读(73) 评论(0) 推荐(0) 编辑
摘要:Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 22; return 1.Example2: version1==”11.22.33”,... 阅读全文
posted @ 2017-11-17 22:28 wangyaning 阅读(99) 评论(0) 推荐(0) 编辑