Skip to content

213 house robber ii - #35

Open
MA-yo-TA wants to merge 4 commits into
mainfrom
213-House-Robber-II
Open

MA-yo-TA wants to merge 4 commits into
mainfrom
213-House-Robber-II

Conversation

@MA-yo-TA

@MA-yo-TA MA-yo-TA commented Sep 1, 2026

Copy link
Copy Markdown
Owner

max_monies_without_begin = [0] * len(nums)
max_monies_without_begin[1] = nums[1]
for i in range(2, len(nums)):
max_monies_from_begin[i] = max(

Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

同じロジックを 2 回書くより、ロジックを関数にくくりだし、開始インデックスと終了インデックスを 2 種類渡して max を取るほうがシンプルになると思いました。

Copy link
Copy Markdown
Owner Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

ありがとうございます。それで書いてみます。

@colorbox

colorbox commented Sep 1, 2026

Copy link
Copy Markdown

配列を二つ用意するのではなく、2次元配列で解くのを試すのも良いかと思いましたが、好みの範囲かなと思いました。

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants