包子求Paper on STEM CELL Transl Med# Biology - 生物学
F*r
1 楼
找出数组里加起来是sum的几个数。
能想到的就是在生成combination的递归算法基础上，对于每一个产生的combination，
test sum 是否成立，如果是就输出。
请问有更好的方法么？
能想到的就是在生成combination的递归算法基础上，对于每一个产生的combination，
test sum 是否成立，如果是就输出。
请问有更好的方法么？
l*i
2 楼
http://stemcellstm.alphamedpress.org/content/early/2013/05/09/s
Please send to l******[email protected] Mnay Thanks
Please send to l******[email protected] Mnay Thanks
z*3
4 楼
Check you link, incomplete link.
F*r
5 楼
the problem is (subset sum), which is NP complete. So I suppose my solution
wasn't that bad?
【在 g***s 的大作中提到】
: http://en.wikipedia.org/wiki/3SUM
wasn't that bad?
【在 g***s 的大作中提到】
: http://en.wikipedia.org/wiki/3SUM
l*i
6 楼
Thanks for pointing out. I changed it.
e*e
7 楼
this is a classic DP problem
g*s
8 楼
连续的才是。这题不是。
】
【在 e*****e 的大作中提到】
: this is a classic DP problem
】
【在 e*****e 的大作中提到】
: this is a classic DP problem
e*e
9 楼
哇~~~不是吧
经典DP啊~~
subset sum....
The array can now be filled in using a simple recursion. Initially, for N ≤
s ≤ P, set
Q(1,s) := (x1 = s).
Then, for i = 2, …, n, set
Q(i,s) := Q(i − 1,s) or (xi = s) or Q(i − 1,s − xi)
for N ≤ s ≤ P.
【在 g***s 的大作中提到】
: 连续的才是。这题不是。
:
: 】
经典DP啊~~
subset sum....
The array can now be filled in using a simple recursion. Initially, for N ≤
s ≤ P, set
Q(1,s) := (x1 = s).
Then, for i = 2, …, n, set
Q(i,s) := Q(i − 1,s) or (xi = s) or Q(i − 1,s − xi)
for N ≤ s ≤ P.
【在 g***s 的大作中提到】
: 连续的才是。这题不是。
:
: 】
e*e
10 楼
这和连不连续没有任何关系~~~
【在 g***s 的大作中提到】
: 连续的才是。这题不是。
:
: 】
【在 g***s 的大作中提到】
: 连续的才是。这题不是。
:
: 】
g*s
11 楼
"In computer science, the subset sum problem is an important problem in
complexity theory and cryptography. The problem is this: given a set of
integers, does the sum of some non-empty subset equal exactly zero? For
example, given the set { −7, −3, −2, 5, 8}, the answer is
yes because
the subset { −3, −2, 5} sums to zero. The problem is NP-complete.
An equivalent problem is this: given a set of integers and an integer s,
does any non-empty subset sum to s? Subset sum can also be thought of as
a special case of the knapsack problem. One interesting special case of
subset sum is the partition problem, in which s is half of the sum of
all elements in the set."
In the question, it doesn't mention
1) they are integer
2) there are range for the numbers
You solution is just for a special case.
【在 e*****e 的大作中提到】
: 这和连不连续没有任何关系~~~
complexity theory and cryptography. The problem is this: given a set of
integers, does the sum of some non-empty subset equal exactly zero? For
example, given the set { −7, −3, −2, 5, 8}, the answer is
yes because
the subset { −3, −2, 5} sums to zero. The problem is NP-complete.
An equivalent problem is this: given a set of integers and an integer s,
does any non-empty subset sum to s? Subset sum can also be thought of as
a special case of the knapsack problem. One interesting special case of
subset sum is the partition problem, in which s is half of the sum of
all elements in the set."
In the question, it doesn't mention
1) they are integer
2) there are range for the numbers
You solution is just for a special case.
【在 e*****e 的大作中提到】
: 这和连不连续没有任何关系~~~
F*r
12 楼
能说说具体怎么实现或者怎么reconstruct soluton么？
【在 e*****e 的大作中提到】
: 哇~~~不是吧
: 经典DP啊~~
: subset sum....
: The array can now be filled in using a simple recursion. Initially, for N ≤
: s ≤ P, set
: Q(1,s) := (x1 = s).
: Then, for i = 2, …, n, set
: Q(i,s) := Q(i − 1,s) or (xi = s) or Q(i − 1,s − xi)
: for N ≤ s ≤ P.
【在 e*****e 的大作中提到】
: 哇~~~不是吧
: 经典DP啊~~
: subset sum....
: The array can now be filled in using a simple recursion. Initially, for N ≤
: s ≤ P, set
: Q(1,s) := (x1 = s).
: Then, for i = 2, …, n, set
: Q(i,s) := Q(i − 1,s) or (xi = s) or Q(i − 1,s − xi)
: for N ≤ s ≤ P.
s*y
13 楼
re
【在 e*****e 的大作中提到】
: 这和连不连续没有任何关系~~~
【在 e*****e 的大作中提到】
: 这和连不连续没有任何关系~~~
i*d
14 楼
N ≤
你这个应该算backtracking。
【在 e*****e 的大作中提到】
: 哇~~~不是吧
: 经典DP啊~~
: subset sum....
: The array can now be filled in using a simple recursion. Initially, for N ≤
: s ≤ P, set
: Q(1,s) := (x1 = s).
: Then, for i = 2, …, n, set
: Q(i,s) := Q(i − 1,s) or (xi = s) or Q(i − 1,s − xi)
: for N ≤ s ≤ P.
相关阅读
公派博后的困惑zt有没有人做过promoter region的点突变啊？曝光变态老板Teresa Fan, Andrew Lane University of Louisvillepaper help, thanks (收到)有人了解Journal of Experimental Medicine这个杂志吗？急求文献视频一篇Journal of Visualized Experiments求离子通道相关的审稿机会！请大家帮我看一下，这么做可行吗？paper help -- 2 baoziK01还是R03，求建议万能的biology版，请帮我找一找这个东西[包子贴］关于elife投稿问几个OPTOGENETICS的基本问题Cancer Immunology Postdoctoral Fellowship (no citizenship restrictions)请教一个英语问题看我是怎么对付混帐无耻变态老板的zt上来吐槽一句A Tragic Tale of Two Postdocs拿了绿卡对生活有没有实质的改变？学病毒的孩子回家咯。。。