lzm风雨无阻 - 博客园

Quikapp快应用开发入门

摘要：快应诞生背景微信的小程序使得很多原来需要调动APP的场景不复存在，正式由于微信小程序的冲击，3月20日，华为联手九大手机厂商，共同举办了“快应用”标准启动发布会。“快应用”是几家手机厂商基于硬件平台共同推出的新型应用生态，用户不必下载安装，即点即用，能够享受到原生应用的性能体验。“快应用”使用前端阅读全文

posted @ 2018-03-26 14:08 lzm风雨无阻阅读(6881) 评论(2) 推荐(1) 编辑

ios面试技术要点

摘要： iOS面试技术总结点（可参考）：多线程运行时 runloop app框架几种动画编程 jsonmodel原理 sdwebimage原理 masonry怎么应用及原理应用框架有哪些说一下Facebook的flux框架混合app原理怎么优化内存怎么用instruments优化动画效果 K 阅读全文

posted @ 2016-10-23 10:40 lzm风雨无阻阅读(391) 评论(0) 推荐(0) 编辑

IOS 使用SDWebImage实现仿新浪微博照片浏览器

摘要：使用第三方库SDWebImage实现仿新浪微博照片浏览器，可以下载图片缓存，点击之后滚动查看相片，具体效果如下：代码如下： WeiboImageView.h： WeiboImageView.m WeiboImageBrowser.h WeiboImageBrowser.m 使用方法： ViewCo 阅读全文

posted @ 2016-08-28 13:37 lzm风雨无阻阅读(1944) 评论(0) 推荐(0) 编辑

IOS UITableView下拉刷新和上拉加载功能的实现

摘要：在IOS开发中UITableView是非常常用的一个功能，而在使用UITableView的时候我们经常要用到下拉刷新和上拉加载的功能，今天花时间实现了简单的UITableView的下拉刷新和上拉加载功能，效果图如下：代码如下： TableRefreshHeaderView.h TableRefre 阅读全文

posted @ 2016-08-12 15:28 lzm风雨无阻阅读(2509) 评论(0) 推荐(0) 编辑

IOS内存管理学习笔记

摘要：内存管理作为iOS中非常重要的部分，每一个iOS开发者都应该深入了解iOS内存管理，最近在学习iOS中整理出了一些知识点，先从MRC开始说起。 1.当一个对象在创建之后它的引用计数器为1，当调用这个对象的alloc、retain、new、copy方法之后引用计数器自动在原来的基础上加1（ObjC中调阅读全文

posted @ 2016-07-31 13:23 lzm风雨无阻阅读(379) 评论(0) 推荐(0) 编辑

IOS实现中间凸起圆形TabBar

摘要：中间凸起的圆形TabBar曾经比较流行，类似于闲鱼之类的APP就使用了中间凸起TabBar，这两天自己动手实现了一个，效果图如下：大致原理：重写UITabBar和UITabBarController，在UITabBar中枚举所有的UITabBarButton类型子控件，重新设置子控件的位置，为中间阅读全文

posted @ 2016-07-09 12:22 lzm风雨无阻阅读(8706) 评论(0) 推荐(0) 编辑

IOS UIScrollView + UIButton 实现segemet页面和顶部标签页水平滚动效果

摘要：很长一段时间没有写博客了，最近在学习iOS开发，看了不少的代码，自己用UIScrollView和UIButton实现了水平滚动的效果，有点类似于今日头条的主界面框架，效果如下：代码如下： MyScrollView.h MyScrollView.m MySegementView.h MySegeme 阅读全文

posted @ 2016-06-29 11:39 lzm风雨无阻阅读(2046) 评论(0) 推荐(1) 编辑

从逆向的角度去理解C++虚函数表

摘要：很久没有写过文章了，自己一直是做C/C++开发的，我一直认为，作为一个C/C++程序员，如果能够好好学一下汇编和逆向分析，那么对于我们去理解C/C++将会有很大的帮助，因为程序中所有的奥秘都藏在汇编中，很多问题我们从表面上无法看出到底是为什么，只要用逆向工具一分析，很快就能知道其中的所以然来。我... 阅读全文

posted @ 2015-09-01 16:14 lzm风雨无阻阅读(2347) 评论(2) 推荐(0) 编辑

摘要：今天参加了百度的面试，面试官要我用C++实现一个模版函数，模版函数的功能是求一个数组的元素个数。#include using namespace std;template int NumOfElement(T (&arr)[n]){ return sizeof(arr) / sizeof(T);}int _tmain(int argc, _TCHAR* argv[]){ int a[100]; printf("%d\n", NumOfElement(a)); return 0;} 阅读全文

posted @ 2013-09-23 20:39 lzm风雨无阻阅读(1208) 评论(0) 推荐(1) 编辑

京东2014年招聘会成都站笔试经历

摘要： 2013年9月10号，我参加了京东在川大的宣讲会，宣讲会场面异常火爆，川大西五演播大厅里面拥挤不堪，六点班开始宣讲，六点左右里面就已经完全满了，我和我同学完全都是挤进去的。宣讲会完了就是笔试，由于人数太多，演播厅根本没法让那么多人进行笔试，所以在就业指导中心又开了一间教室给我们笔试，走到那边发现位子都没了，没办法，只能找个位置站着，还好我站的位置靠窗，刚好可以趴在窗台上做题。面试的题目很多都是关于做网站这方面的，向数据库和Java这方面的题目我几乎不会，因为那不是我的方向。前面有几道数据结构的题目，感觉挺基础的，但是通过那几道题我还是看出自己基础方面的不足，中间和同学对了一下答案，一个... 阅读全文

posted @ 2013-09-12 10:14 lzm风雨无阻阅读(1740) 评论(0) 推荐(0) 编辑

把一个字符串的大写字母放到字符串的后面，各个字符的相对位置不变，不能申请额外的空间

摘要：腾讯一面试题，采用冒泡排序的思想，大写字母向后移动，小写字母向前移动，时间复杂度为O(N^2)。#include #include #include int main(){ char str[100]; while (scanf("%s", str) != EOF) { int n, j; int nLen = strlen(str); for (int i = nLen - 1; i > 0; i--) { if (islower(str[i])) { ... 阅读全文

posted @ 2013-08-31 16:46 lzm风雨无阻阅读(4705) 评论(0) 推荐(0) 编辑

POJ 2234 Matches Game

摘要： Matches GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:7567Accepted:4327DescriptionHere is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the p 阅读全文

posted @ 2013-08-18 21:01 lzm风雨无阻阅读(752) 评论(0) 推荐(0) 编辑

POJ 3903 Stock Exchange

摘要： Stock ExchangeTime Limit:1000MSMemory Limit:65536KTotal Submissions:2954Accepted:1082DescriptionThe world financial crisis is quite a subject. Some people are more relaxed while others are quite anxious. John is one of them. He is very concerned about the evolution of the stock exchange. He follows 阅读全文

posted @ 2013-08-18 13:58 lzm风雨无阻阅读(502) 评论(0) 推荐(1) 编辑

POJ 2853 Sequence Sum Possibilities

摘要： Sequence Sum PossibilitiesTime Limit:1000MSMemory Limit:65536KTotal Submissions:5537Accepted:3641DescriptionMost positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance,6 = 1 + 2 + 39 = 5 + 4 = 2 + 3 + 4but8cannot be so written.Write a prog 阅读全文

posted @ 2013-08-17 22:23 lzm风雨无阻阅读(599) 评论(0) 推荐(0) 编辑

POJ 3519 Minimal Backgammon

摘要： Minimal BackgammonTime Limit:5000MSMemory Limit:65536KTotal Submissions:1195Accepted:700Special JudgeDescriptionFigure 2: An example gameHere is a very simple variation of the game backgammon, named “Minimal Backgammon”. The game is played by only one player, using only one of the dice and only one 阅读全文

posted @ 2013-08-17 20:54 lzm风雨无阻阅读(395) 评论(0) 推荐(0) 编辑

POJ 2096 Collecting Bugs

摘要： Collecting BugsTime Limit:10000MSMemory Limit:64000KTotal Submissions:1716Accepted:783Case Time Limit:2000MSSpecial JudgeDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he clas 阅读全文

posted @ 2013-08-17 16:48 lzm风雨无阻阅读(229) 评论(0) 推荐(0) 编辑

POJ 3071 Football

摘要： FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:2366Accepted:1191DescriptionConsider a single-elimination football tournament involving 2nteams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index. Th 阅读全文

posted @ 2013-08-17 14:17 lzm风雨无阻阅读(354) 评论(0) 推荐(0) 编辑

HDU 1175 连连看

摘要：连连看Time Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14418Accepted Submission(s): 3778Problem Description“连连看”相信很多人都玩过。没玩过也没关系，下面我给大家介绍一下游戏规则：在一个棋盘中，放了很多的棋子。如果某两个相同的棋子，可以通过一条线连起来（这条线不能经过其它棋子），而且线的转折次数不超过两次，那么这两个棋子就可以在棋盘上消去。不好意思，由于我以前没有玩过连连看，咨询了同学的意阅读全文

posted @ 2013-08-16 21:12 lzm风雨无阻阅读(742) 评论(0) 推荐(0) 编辑

POJ 2676 Sudoku

摘要： SudokuTime Limit:2000MSMemory Limit:65536KTotal Submissions:12005Accepted:5984Special JudgeDescriptionSudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. The ot 阅读全文

posted @ 2013-08-16 20:52 lzm风雨无阻阅读(340) 评论(0) 推荐(0) 编辑

POJ 3320 Jessica's Reading Problem

摘要： Jessica's Reading ProblemTime Limit:1000MSMemory Limit:65536KTotal Submissions:6001Accepted:1800DescriptionJessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to master 阅读全文

posted @ 2013-08-16 16:39 lzm风雨无阻阅读(922) 评论(0) 推荐(0) 编辑

POJ 1035 Spell checker

摘要： Spell checkerTime Limit:2000MSMemory Limit:65536KTotal Submissions:16826Accepted:6154DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their for 阅读全文

posted @ 2013-08-16 10:44 lzm风雨无阻阅读(720) 评论(0) 推荐(0) 编辑

POJ 2785 4 Values whose Sum is 0

摘要： 4 Values whose Sum is 0Time Limit:15000MSMemory Limit:228000KTotal Submissions:13069Accepted:3669Case Time Limit:5000MSDescriptionThe SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b 阅读全文

posted @ 2013-08-15 20:18 lzm风雨无阻阅读(364) 评论(0) 推荐(0) 编辑

POJ 1186 方程的解数

摘要：方程的解数Time Limit:15000MSMemory Limit:128000KTotal Submissions:6188Accepted:2127Case Time Limit:5000MSDescription已知一个n元高次方程：其中：x1, x2,...,xn是未知数，k1,k2,...,kn是系数，p1,p2,...pn是指数。且方程中的所有数均为整数。假设未知数1 #include #define Max 4000037 int hash[Max],num[Max]; //hash判断和的位置，num是和为s的个数 bool used[Max]; ... 阅读全文

posted @ 2013-08-15 17:28 lzm风雨无阻阅读(933) 评论(2) 推荐(0) 编辑

HDU 3999 The order of a Tree

摘要： The order of a TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 845Accepted Submission(s): 461Problem DescriptionAs we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely:1.insert a key k to 阅读全文

posted @ 2013-08-15 14:48 lzm风雨无阻阅读(395) 评论(0) 推荐(0) 编辑

HDU 3791 二叉搜索树

摘要：二叉搜索树Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2148Accepted Submission(s): 957Problem Description判断两序列是否为同一二叉搜索树序列Input开始一个数n，(1#include #include #include using namespace std;typedef struct node{ char data; node *lchild; node *rchild... 阅读全文

posted @ 2013-08-15 14:13 lzm风雨无阻阅读(285) 评论(0) 推荐(0) 编辑

POJ 2255 Tree Recovery

摘要： Tree RecoveryTime Limit:1000MSMemory Limit:65536KTotal Submissions:9879Accepted:6210DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.This is an example of one of her creations: .. 阅读全文

posted @ 2013-08-14 21:50 lzm风雨无阻阅读(243) 评论(0) 推荐(0) 编辑

POJ 2524 Ubiquitous Religions

摘要： Ubiquitous ReligionsTime Limit:5000MSMemory Limit:65536KTotal Submissions:20668Accepted:10153DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your university 阅读全文

posted @ 2013-08-14 20:31 lzm风雨无阻阅读(988) 评论(0) 推荐(0) 编辑

POJ 1611 The Suspects

摘要： The SuspectsTime Limit:1000MSMemory Limit:20000KTotal Submissions:18859Accepted:9130DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separa 阅读全文

posted @ 2013-08-14 17:17 lzm风雨无阻阅读(301) 评论(0) 推荐(0) 编辑

POJ 1816 Wild Words

摘要： Wild WordsTime Limit:2000MSMemory Limit:65536KTotal Submissions:4412Accepted:1149DescriptionA word is a string of lowercases. A word pattern is a string of lowercases, '?'s and '*'s. In a pattern, a '?' matches any single lowercase, and a '*' matches none or more lowe 阅读全文

posted @ 2013-08-14 14:16 lzm风雨无阻阅读(319) 评论(0) 推荐(0) 编辑

POJ 1650 Integer Approximation

摘要： Integer ApproximationTime Limit:1000MSMemory Limit:65536KTotal Submissions:5081Accepted:1652DescriptionThe FORTH programming language does not support floating-point arithmetic at all. Its author, Chuck Moore, maintains that floating-point calculations are too slow and most of the time can be emulat 阅读全文

posted @ 2013-08-13 21:35 lzm风雨无阻阅读(554) 评论(0) 推荐(0) 编辑

POJ 1363 Rails

摘要： RailsTime Limit:1000MSMemory Limit:10000KTotal Submissions:21728Accepted:8703DescriptionThere is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It was possible to establish onl 阅读全文

posted @ 2013-08-13 20:55 lzm风雨无阻阅读(540) 评论(0) 推荐(0) 编辑

POJ 1804 Brainman

摘要： BrainmanTime Limit:1000MSMemory Limit:30000KTotal Submissions:7787Accepted:4247DescriptionBackgroundRaymond Babbitt drives his brother Charlie mad. Recently Raymond counted 246 toothpicks spilled all over the floor in an instant just by glancing at them. And he can even count Poker cards. Charlie wo 阅读全文

posted @ 2013-08-13 17:33 lzm风雨无阻阅读(829) 评论(0) 推荐(0) 编辑

POJ 2078 Matrix

摘要： MatrixTime Limit:2000MSMemory Limit:30000KTotal Submissions:3239Accepted:1680DescriptionGiven an n*n matrix A, whose entries Ai,j are integer numbers ( 0 #include #include using namespace std;int ans = 0x7fffffff;void Shift(int row, int n, int matrix[10][10]){ int temp = matrix[row][n - 1]; fo... 阅读全文

posted @ 2013-08-12 16:38 lzm风雨无阻阅读(801) 评论(0) 推荐(0) 编辑

POJ 2082 Terrible Sets

摘要： Terrible SetsTime Limit:1000MSMemory Limit:30000KTotal Submissions:2747Accepted:1389DescriptionLet N be the set of all natural numbers {0 , 1 , 2 , . . . }, and R be the set of all real numbers. wi, hi for i = 1 . . . n are some elements in N, and w0 = 0.Define set B = { | x, y ∈ R and there exists 阅读全文

posted @ 2013-08-12 15:30 lzm风雨无阻阅读(702) 评论(0) 推荐(1) 编辑

POJ 1013 Counterfeit Dollar

摘要： Counterfeit DollarTime Limit:1000MSMemory Limit:10000KTotal Submissions:36206Accepted:11561DescriptionSally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguishable from the 阅读全文

posted @ 2013-08-12 11:11 lzm风雨无阻阅读(363) 评论(0) 推荐(0) 编辑

POJ 1012 Joseph

摘要： JosephTime Limit:1000MSMemory Limit:10000KTotal Submissions:44650Accepted:16837DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle every mth is going to be executed and on 阅读全文

posted @ 2013-08-12 09:45 lzm风雨无阻阅读(3954) 评论(0) 推荐(0) 编辑

POJ 2083 Fractal

摘要： FractalTime Limit:1000MSMemory Limit:30000KTotal Submissions:6646Accepted:3297DescriptionA fractal is an object or quantity that displays self-similarity, in a somewhat technical sense, on all scales. The object need not exhibit exactly the same structure at all scales, but the same "type" 阅读全文

posted @ 2013-08-12 08:56 lzm风雨无阻阅读(815) 评论(0) 推荐(0) 编辑

POJ 1308 Is It A Tree?

摘要： Is It A Tree?Time Limit:1000MSMemory Limit:10000KTotal Submissions:18778Accepted:6395DescriptionA tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties.There is exa 阅读全文

posted @ 2013-08-11 21:23 lzm风雨无阻阅读(310) 评论(0) 推荐(0) 编辑

POJ 1631 Bridging signals

摘要： Bridging signalsTime Limit:1000MSMemory Limit:10000KTotal Submissions:9441Accepted:5166Description'Oh no, they've done it again', cries the chief designer at the Waferland chip factory. Once more the routing designers have screwed up completely, making the signals on the chip connecting 阅读全文

posted @ 2013-08-11 19:38 lzm风雨无阻阅读(313) 评论(0) 推荐(0) 编辑

POJ 1451 T9

摘要： T9Time Limit:1000MSMemory Limit:10000KTotal Submissions:3083Accepted:1101DescriptionBackgroundA while ago it was quite cumbersome to create a message for the Short Message Service (SMS) on a mobile phone. This was because you only have nine keys and the alphabet has more than nine letters, so most c 阅读全文

posted @ 2013-08-10 19:59 lzm风雨无阻阅读(390) 评论(0) 推荐(0) 编辑

导航

公告