1
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?

More than 3 years have passed since last update.

【JavaScript】最大和問題を動的計画法で解く

Last updated at Posted at 2021-11-13

こちらの記事を参考に最大和問題を勉強していくなかで,JavaScriptでコードを再現してみたメモ.

const main = (numList) => {
    const length = numList.length
    let dp = [...Array(length + 10)].map((_) => 0);

    for (let i = 0; i < length; i++) {
        dp[i + 1] = Math.max(dp[i], dp[i] + numList[i]);
    }

    return dp[length];
}

console.log(main([7, -6, -9])) // 7
1
0
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
1
0

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?