Skip to content

Conversation

@I-am-ZiHao
Copy link

Summary

優化 62. Unique Paths 原先的解法:

  1. 原使用二維陣列來儲存,但其實只需要一維。
  2. 無需特別針對 i == 0 or j == 0 做處理,一開始就初始化為 1 即可。

Test Plan

Screenshot 2025-02-28 at 3 52 56 PM

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.

1 participant