Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 55bb18c

Browse files
Update Readme.md
1 parent 025553f commit 55bb18c

File tree

1 file changed

+1
-1
lines changed
  • Recursion/3704.Count-No-Zero-Pairs-That-Sum-to-N

1 file changed

+1
-1
lines changed

‎Recursion/3704.Count-No-Zero-Pairs-That-Sum-to-N/Readme.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,4 +6,4 @@
66

77
所以状态需要四个参量memo[pos][carry][endA][endB],pos表示当前处理第k位,carry表示之前一位带来的进位,endA表示A已经结束构造,endB表示B已经结束构造。
88

9-
总的状态有15*2*2*2=120,加上每种状态有100种fanout组合,所以总的时间复杂度可以结束。
9+
总的状态有`15*2*2*2=120`,加上每种状态有100种fanout组合,所以总的时间复杂度可以结束。

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /