Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Main {
- public static void main(String[] args) {
- // Queue<Integer> queue = QueueUtility.createIntQueue();
- // Stack<Queue<Integer>> stack = new Stack<Queue<Integer>>();
- // stack.push(QueueUtility.duplicate(queue));
- // queue.remove();
- // stack.push(QueueUtility.duplicate(queue));
- // queue.remove();
- // stack.push(QueueUtility.duplicate(queue));
- // queue.remove();
- // stack.push(QueueUtility.duplicate(queue));
- // Stack<Character> stackChar = new Stack<Character>();
- // Node<Character> nodeChar = new Node<Character>(null);
- // stackChar.push('s');
- // stackChar.push('b');
- // stackChar.push('d');
- // nodeChar.setValue('s');
- // nodeChar.setNext(new Node<Character>('b'));
- // nodeChar.getNext().setNext(new Node<Character>('d'));
- //// System.out.println(Functions.stacksToStackSums(stack).toString());
- // System.out.println(Functions.stackEqualsNode(nodeChar, stackChar));
- Stack<Integer> stack = StackFunctions.intStack();
- Stack<Integer> stack2 = StackFunctions.intStack();
- Stack<Integer> stack3 = StackFunctions.intStack();
- Node<Stack<Integer>> listStack = new Node<Stack<Integer>>(stack);
- Node<Stack<Integer>> dupli = listStack;
- listStack.setNext(new Node<Stack<Integer>>(stack2));
- listStack = listStack.getNext();
- listStack.setNext(new Node<Stack<Integer>>(stack3));
- System.out.println(Functions.sortedComplex(dupli).toString());
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement