New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

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

Jump to bottom

合并两个有序数组 #1

Open

AlwaysHugry opened this issue Mar 20, 2020 · 1 comment

Owner

AlwaysHugry commented Mar 20, 2020

设子数组A[0:k]和A[k+1:N-1]已排好序(0≤K≤N-1)。试设计一个合并这2个子数组为排好序的数组A[0:N-1]的算法。要求算法在最坏情况下所用的计算时间为O(N)，只用到O(1)的辅助空间。

Owner Author

AlwaysHugry commented Mar 28, 2020

有无大佬支个招

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment