logo CodeStepByStep logo

splitStack

Language/Type: C++ Stack Queue collections
Related Links:
Author: Marty Stepp (on 2016/06/16)

Write a function named splitStack that accepts as a parameter a reference to a Stack of integers, and re-orders it so that all the non-negative numbers are at the top in the reverse of their original relative order, and all the negative numbers are at the bottom in the reverse of their original relative order. For example, if passed the stack {4, 0, -1, 5, -6, -3, 2, 7}, your function should modify the stack to store {-3, -6, -1, 7, 2, 5, 0, 4}.

Constraints: Do not declare any auxiliary data structures (e.g. arrays, Grids, Vectors, etc.) other than a single Queue of integers.

Type your C++ solution code here:


This is a function problem. Write a C++ function as described. Do not write a complete program; just the function(s) above.

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.