Skip to content

关于题解一源码分析的i >= right条件#112

Merged
billryan merged 1 commit intobillryan:masterfrom
JuneYuan:patch-1
May 19, 2018
Merged

关于题解一源码分析的i >= right条件#112
billryan merged 1 commit intobillryan:masterfrom
JuneYuan:patch-1

Conversation

@JuneYuan
Copy link
Contributor

题解一源码分析对于i >= right的讨论,认为没有必要。因为for 循环保证了 i 每次都增加1,而 right 是满足条件才增加1,所以i >= right恒成立,只需要 if (nums[i] < k) 就够了。
另外,nums[i]nums[right]swap 操作,可以加上 if (i != right) 限定,避免了自己与自己的交换,代码也更好理解~

题解一源码分析对于`i >= right`的讨论,认为没有必要。因为`for 循环`保证了 `i` 每次都增加`1`,而 `right` 是满足条件才增加`1`,所以`i >= right`恒成立,只需要 `if (nums[i] < k)` 就够了。
另外,`nums[i]` 与 `nums[right]` 的 `swap` 操作,可以加上 `if (i != right)` 限定,避免了自己与自己的交换,代码也更好理解~
@billryan
Copy link
Owner

同意~ 👍

@billryan billryan merged commit 91899b6 into billryan:master May 19, 2018
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.

2 participants