码迷,mamicode.com
首页 >  
搜索关键字:note    ( 7358个结果
【BZOJ2243】【SDOI2011】染色 树链剖分
题解: 线段树节点维护区间最左边的颜色,最右边颜色,总段,然后查询时加入所有链的段数,然后根据颜色判断哪俩链多算了一段。 大水题。 本来以为20min思路清晰地打完一发180行代码很屌。 …… 俩小错误。(没有任何可以借鉴的价值) 一个是EDIT(note 一个是有一个地方忘了pushdown了。 写了好久,调了好久,拍了好久,WA了好久。什么 状态啊。 给代码、数据生成...
分类:其他好文   时间:2014-11-24 17:13:55    阅读次数:159
Multiply Strings(字符串乘法模拟,包含了加法模拟)
Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-nega...
分类:其他好文   时间:2014-11-24 13:22:55    阅读次数:114
Construct Binary Tree from Inorder and Postorder Traversal
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.C++实现代码:#inclu...
分类:其他好文   时间:2014-11-24 11:47:33    阅读次数:281
Construct Binary Tree from Preorder and Inorder Traversal
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.提交成功的代码:C++实现:#...
分类:其他好文   时间:2014-11-24 11:26:30    阅读次数:251
【leetcode】Subsets (Medium) ☆
Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co...
分类:其他好文   时间:2014-11-23 17:25:14    阅读次数:198
LeetCode——Subsets
Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets. For exa...
分类:其他好文   时间:2014-11-23 14:34:54    阅读次数:158
three.js 源码注释(二十)Core/Clock.js
Clock对象的构造函数.用来记录时间.Clock对象的功能函数采用 定义构造的函数原型对象来实现. 用法: var clock = new Clock(true) 创建时钟用来记录时间,传递参数true,设置自动开始记录. NOTE: 参数(autostart)为true,自动开始记录,省略该参数也自动开始记录时间,设置为false,穿件时间,但不开始记录.以毫秒为单位,从 1 January 1970 00:00:00 UTC开始....
分类:Web程序   时间:2014-11-23 13:15:41    阅读次数:201
Subsets II
Given a collection of integers that might contain duplicates,S, return all possible subsets.Note:Elements in a subset must be in non-descending order....
分类:其他好文   时间:2014-11-23 12:56:59    阅读次数:179
[leetcode]
问题描述: Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree. 基本思路: 与前一篇《Construct Binary Tree from Preord...
分类:其他好文   时间:2014-11-23 11:51:28    阅读次数:172
Subsets
Given a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not co...
分类:其他好文   时间:2014-11-23 11:42:48    阅读次数:233
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!