mirror of
https://github.com/ShusenTang/LeetCode.git
synced 2024-09-02 14:20:01 +00:00
fix table bug
This commit is contained in:
parent
eb2aaade41
commit
c7033cd6a4
@ -7,7 +7,7 @@
|
|||||||
我们假设把N拆分成k个连续的数之和,并设最小的那个数是m,则我们有:
|
我们假设把N拆分成k个连续的数之和,并设最小的那个数是m,则我们有:
|
||||||
|
|
||||||
|k| 1 | 2 | 3 | 4 | ... | K |
|
|k| 1 | 2 | 3 | 4 | ... | K |
|
||||||
|---|:-:|:-:|:-:|:-:|:-:|:-:|:-:|
|
|---|:-:|:-:|:-:|:-:|:-:|:-:|
|
||||||
|连续序列|m|m,m+1|m,m+1,m+2|m,m+1,m+2,m+3|...|m,m+1,m+K-1|
|
|连续序列|m|m,m+1|m,m+1,m+2|m,m+1,m+2,m+3|...|m,m+1,m+K-1|
|
||||||
|满足关系|N=m|N = 2m+1| N = 3m+3| N = 4m+6|...| N = Km + f(k) |
|
|满足关系|N=m|N = 2m+1| N = 3m+3| N = 4m+6|...| N = Km + f(k) |
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user