Skip to content
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.

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

PAT Advanced 1057 Stack (树状数组) | Joke-Lin | BLOG #47

Closed
Weijun-Lin opened this issue May 16, 2020 · 0 comments
Closed

PAT Advanced 1057 Stack (树状数组) | Joke-Lin | BLOG #47

Weijun-Lin opened this issue May 16, 2020 · 0 comments

Comments

@Weijun-Lin
Copy link
Owner

https://joke-lin.top/2020/05/14/2020-05-14-PAT-Advanced-1057/

题目描述
题目地址
给定栈的一系列POP,PUSH操作,求执行这些操作后的栈中从小到大排序的中位数(询问中位数的操作是多次的)

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

No branches or pull requests

1 participant