码迷,mamicode.com
首页 >  
搜索关键字:maximum    ( 4142个结果
LeetCode 124:Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The ...
分类:其他好文   时间:2015-12-31 12:58:16    阅读次数:172
仿苹果手机通讯录按字母定位
<!DOCTYPEhtml> <html> <head> <metacharset="utf-8"> <metahttp-equiv="X-UA-Compatible"content="IE=edge"> <metaname="viewport"content="width=device-width,initial-scale=1.0,minimum-scale=1.0,maximum-scale=1.0,user-scalable=no"/&..
分类:移动开发   时间:2015-12-28 18:40:35    阅读次数:206
LeetCode - Maximum Subarray
题目:Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [?2,1,?3,4,?1...
分类:其他好文   时间:2015-12-27 09:37:59    阅读次数:191
ural 1146. Maximum Sum
1146. Maximum SumTime limit: 0.5 secondMemory limit: 64 MBGiven a 2-dimensional array of positive and negative integers, find the sub-rectangle with t...
分类:其他好文   时间:2015-12-26 11:32:22    阅读次数:210
移动WEB前端开发资源整合
meta篇1.视窗宽度其中width=device-width是设置视窗宽度为设备视窗宽度,还可以固定宽度,例如:width=640则是640px的宽度(常见于微信);initial-scale=1.0:设置缩放比例为1.0;minimum-scale=1.0和maximum-scale=1.0:最...
分类:移动开发   时间:2015-12-25 23:46:07    阅读次数:248
[LeetCode]113. Maximum Depth of Binary Tree二叉树的最大深度
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类:其他好文   时间:2015-12-25 20:59:38    阅读次数:167
[共通]手机端网页开发问题及解决方法整理
Q1:手机端开发网页,界面适应问题。A1:<metaname="viewport"content="width=device-width,initial-scale=1.0,maximum-scale=1.0,user-scalable=no"/>width-viewport的宽度height-viewport的高度initial-scale-初始的缩放比例minimum-scale-允许用户缩放到的最小比例max..
分类:移动开发   时间:2015-12-24 16:37:06    阅读次数:176
uboot启动 及命令分析(3)
u-boot命令先贴一个重要结构,位于uboot/include/command.h,这个结构代表每个uboot命令structcmd_tbl_s{char*name;/* Command Name*/intmaxargs;/* maximum number of arguments*/intrep...
分类:其他好文   时间:2015-12-23 16:12:30    阅读次数:258
[LeetCode53]Maximum Subarray最大字段和
问题:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array[?2,1,?3,4,?1,2...
分类:其他好文   时间:2015-12-23 00:30:52    阅读次数:182
Python函数,参数,变量
func1.pydef sayHello(): print ('hello world')sayHello()func_parm.pydef printMax(a,b): if a>b: print (a,'is maximum') else: prin...
分类:编程语言   时间:2015-12-22 12:54:08    阅读次数:129
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!