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

关于1.1章节的思考 #427

Open
unigogyk opened this issue Aug 14, 2015 · 0 comments
Open

关于1.1章节的思考 #427

unigogyk opened this issue Aug 14, 2015 · 0 comments

Comments

@unigogyk
Copy link

对于该题目能否使用循环队列来解决?
我的想法是,将字符数组组织成一个循环队列,每次从队列头部出队一个元素,并将其保存到辅助存储空间中,然后再将这个元素在队尾入队。这样的话,可以达到时间和空间复杂度的要求。不知道我这样有问题么?还请指导,谢谢了

@unigogyk unigogyk changed the title 关于1.1章节 关于1.1章节的思考 Aug 14, 2015
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

No branches or pull requests

1 participant