码迷,mamicode.com
首页 >  
搜索关键字:pascals triangle ii    ( 7733个结果
LeetCode "Populating Next Right Pointers in Each Node II"
Compared with I version, the tree could be incomplete. The only difference is that, we connect current node's child to next non-childrenless' node's f...
分类:其他好文   时间:2014-07-26 17:02:11    阅读次数:316
[Leetcode]Combination Sum II
Leetcode Combination Sum II,略有疑惑求讨论...
分类:其他好文   时间:2014-07-26 15:30:12    阅读次数:155
SPOJ QTREE系列 树上分治问题。
375.Query on a tree 【QTREE】 有两个操作: (1)修改第i条边的边权 (2)询问a到b路径上的边权最大值。 树链剖分入门题。树链剖分+线段树维护最大值。修改/查询均为O(log^2)。 很懒,没有写。913.Query on a tree II 【QTREE2...
分类:其他好文   时间:2014-07-26 13:53:45    阅读次数:569
spoj gss2 : Can you answer these queries II 离线&&线段树
1557. Can you answer these queries IIProblem code: GSS2Being a completist and a simplist, kid Yang Zhe cannot solve but get Wrong Answer from most of....
分类:其他好文   时间:2014-07-26 05:44:27    阅读次数:377
ACDream - Dynamic Inversions II
先上题目:A-Dynamic Inversions IITime Limit:6000/3000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatusProblem Description给出N个数a[1],a[2]...
分类:其他好文   时间:2014-07-25 13:56:21    阅读次数:272
HDU 1002 A + B Problem II
A + B Problem II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 209025    Accepted Submission(s): 40177 Problem Description I have...
分类:其他好文   时间:2014-07-25 11:12:01    阅读次数:206
Dynamic Inversions II 逆序数的性质 树状数组求逆序数
Dynamic Inversions IITime Limit:6000/3000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatusProblem Description给出N个数a[1],a[2] ... a[...
分类:其他好文   时间:2014-07-25 02:44:34    阅读次数:168
css实现三角的一些方法
css实现三角没有想象中的那么难,只要明白border的各种属性的意思就很好明白css三角是如何实现的。一下是几个很简单的例子:css三角形状的制作: css样式: .triangle{ width:0; height:0; border-left:10px solid transpare...
分类:Web程序   时间:2014-07-24 17:21:45    阅读次数:259
[LeetCode] Pascal's Triangle
Given numRows, generate the first numRows of Pascal's triangle.For example, given numRows = 5, Return[ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,...
分类:其他好文   时间:2014-07-24 11:28:32    阅读次数:228
Reverse Linked List II leetcode java
题目:Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->....
分类:编程语言   时间:2014-07-24 09:49:43    阅读次数:204
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!