COURSESTime Limit:1000MSMemory Limit:10000KTotal
Submissions:16877Accepted:6627DescriptionConsider a group of N students and P
courses. Each student v...
分类:
其他好文 时间:
2014-06-06 23:22:36
阅读次数:
191
Air RaidTime Limit:1000MSMemory Limit:10000KTotal
Submissions:6520Accepted:3877DescriptionConsider a town where all the streets
are one-way and each s...
分类:
其他好文 时间:
2014-06-06 23:19:59
阅读次数:
319
原题地址:https://oj.leetcode.com/problems/triangle/题意:Given
a triangle, find the minimum path sum from top to bottom. Each step you may move
to adjacent n...
分类:
编程语言 时间:
2014-06-06 17:31:34
阅读次数:
397
Given a sorted linked list, delete all
duplicates such that each element appear onlyonce.For
example,Given1->1->2, return1->2.Given1->1->2->3->3,
retu...
分类:
其他好文 时间:
2014-06-06 14:54:28
阅读次数:
221
1.Update Value On: 指明了参数在何时编号1.1 Each Occurrence :
只要发现该参数就重新取值;1.2 Each iteration :每次反复都要取新值(各个并发会共享同一个值,用于多次引用参数且相关的情况);1.3 Once
:在所有的反复中都使用同一个值(仅在场...
分类:
其他好文 时间:
2014-06-06 14:02:47
阅读次数:
198
注意题目这句话,Once you have each type of candies in a
box, you want to pack those boxes into larger boxes, until only one box
remains.两个box合并后必须放入更大一个盒子题目的有...
分类:
其他好文 时间:
2014-06-06 13:09:50
阅读次数:
213
Given a binary tree containing digits
from0-9only, each root-to-leaf path could represent a number.An example is the
root-to-leaf path1->2->3which rep...
分类:
其他好文 时间:
2014-06-06 12:38:42
阅读次数:
255
An iterative algorithm takes one step at a
time, ensuring that each step makes progress while maitining the loop
invariant.A paradigm shift:View an al...
分类:
其他好文 时间:
2014-06-02 19:20:20
阅读次数:
286
问题描述:
Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
If d(a) = b and d(b) = a, where a b, then a and b are
an amicable pair and each ...
分类:
编程语言 时间:
2014-06-02 12:31:42
阅读次数:
298
题意:对数列有三种操作:
Print operation l,?r. Picks should write down the value of .
Modulo operation l,?r,?x. Picks should perform assignment a[i]?=?a[i] mod x for
each i (l?≤?i?≤?r).
Set operation k...
分类:
其他好文 时间:
2014-06-02 02:56:56
阅读次数:
465