We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
algo/java/12_sorts/KthSmallest.java
Lines 16 to 19 in cc245cd
The text was updated successfully, but these errors were encountered:
比如第 12 课快排的例子,[11, 8, 3, 9, 7, 1, 2, 5] 找第 3 小元素,以最后的元素作为 pivot,正常递归 2 次可以返回 3,但这里在 while 循环里跑了大于 2 次。因为 partition() 函数以 0 开头/arr.length - 1 结尾。
Sorry, something went wrong.
No branches or pull requests
algo/java/12_sorts/KthSmallest.java
Lines 16 to 19 in cc245cd
The text was updated successfully, but these errors were encountered: