码迷,mamicode.com
首页 >  
搜索关键字:adding    ( 699个结果
[Erlang 0129] Erlang 杂记 VI
把之前阅读资料的时候记下的东西,整理了一下.Adding special-purpose processor support to the Erlang VMP23简单介绍了Erlang Compiler和Beam文件格式;The Erlang Compiler in short 章节提到了 Cor...
分类:其他好文   时间:2014-10-28 21:31:39    阅读次数:345
Comments and whitespace
In this video, I'll show you the various ways of adding comments to PHP scripts.小结一下几种注释形式:HTML: ;CSS: /* */ ;JS: // , /* */ ;PHP: # , // , /* */ ; I'...
分类:其他好文   时间:2014-10-28 12:03:27    阅读次数:261
leetcode Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类:其他好文   时间:2014-10-28 07:02:27    阅读次数:171
[leetcode] Path Sum
问题描述: Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree...
分类:其他好文   时间:2014-10-26 13:11:29    阅读次数:177
Exercise 21: Functions Can Return Something
def add(a, b):print "ADDING %d + %d" % (a, b)return a + bdef subtract(a, b):print "SUBTRACTING %d - %d" % (a, b) return a - bdef multiply(a, b): ...
分类:其他好文   时间:2014-10-24 10:47:09    阅读次数:243
how to remove MouseListener / ActionListener on a JTextField(转)
I have the following code adding an ActionListener to a JTextField:chatInput.addMouseListener(new java.awt.event.MouseAdapter() { public void mouse...
分类:其他好文   时间:2014-10-22 09:53:09    阅读次数:124
LeetCode Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类:其他好文   时间:2014-10-20 22:58:44    阅读次数:305
Path Sum 路径和
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类:其他好文   时间:2014-10-20 14:47:59    阅读次数:168
Path Sum
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.Fo...
分类:其他好文   时间:2014-10-20 11:21:40    阅读次数:184
UVA1492 - Adding New Machine(扫描线)
UVA1492 - Adding New Machine(扫描线) 题目链接 题目大意:给你N?M个格子,这些格子中某些格子是放了旧的机器,然后问现在要在这些格子放一台1?M的新机器,问有多少种放法。 解题思路:这题照样是可以转换成面积并来做,对于有旧机器(x,y)的格子,那么(x - M + 1,y)都是不可以放新机器的格子,还有从(H - M + 2,H)都是不可以放新机器的...
分类:系统相关   时间:2014-10-19 21:26:11    阅读次数:346
699条   上一页 1 ... 59 60 61 62 63 ... 70 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!