avatar
k*i
1
You're given an array containing both positive and negative integers and
required to find the subarray with the largest sum
avatar
l*t
2
Dynamic programming.

【在 k***i 的大作中提到】
: You're given an array containing both positive and negative integers and
: required to find the subarray with the largest sum

avatar
P*t
3
不用DP,O(N)就够了吧。

【在 l***t 的大作中提到】
: Dynamic programming.
avatar
c*t
4
It's DP with O(N) time.

【在 P***t 的大作中提到】
: 不用DP,O(N)就够了吧。
avatar
P*t
5
I don't think the method is clearly a DP method. By definition, DP is to
divide the problem with sub problems. But the solution doesn't have much to
do with sub problems.

【在 c*****t 的大作中提到】
: It's DP with O(N) time.
avatar
N*y
6
You are wrong. Think in the way of DP, don't just remember the definition of
DP.

to

【在 P***t 的大作中提到】
: I don't think the method is clearly a DP method. By definition, DP is to
: divide the problem with sub problems. But the solution doesn't have much to
: do with sub problems.

avatar
P*t
7
Tell me how you define subproblem here. And how your subproblem will be used
more than once to solve bigger problems.

of

【在 N*********y 的大作中提到】
: You are wrong. Think in the way of DP, don't just remember the definition of
: DP.
:
: to

相关阅读
logo
联系我们隐私协议©2024 redian.news
Redian新闻
Redian.news刊载任何文章,不代表同意其说法或描述,仅为提供更多信息,也不构成任何建议。文章信息的合法性及真实性由其作者负责,与Redian.news及其运营公司无关。欢迎投稿,如发现稿件侵权,或作者不愿在本网发表文章,请版权拥有者通知本网处理。