Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package ex003;
- public class Pilha {
- int[] elements;
- int top = 0;
- int remove = 0;
- public Pilha() {
- elements = new int[4];
- }
- public void push(int value) {
- if (!isFull()) {
- elements[top] = value;
- top++;
- } else {
- System.out.println("Pilha cheia");
- }
- }
- public int pop() {
- if (!isEmpty()) {
- remove = elements[--top];
- elements[top] = 0;
- return remove;
- } else {
- return -1;
- }
- }
- private boolean isFull() {
- if (top == elements.length)
- return true;
- return false;
- }
- private boolean isEmpty() {
- if (top == 0)
- return true;
- return false;
- }
- public void reorganizar(Pilha pilha) {
- Pilha par = new Pilha();
- Pilha impar = new Pilha();
- int atual;
- for (int i = 0; i < elements.length; i++) {
- atual = pilha.pop();
- if(atual % 2 == 0) {
- par.push(atual);
- }else {
- impar.push(atual);
- }
- }
- for (int j = 0; j < par.elements.length; j++) {
- System.out.println(par.elements[j]);
- }
- for (int k = 0; k < impar.elements.length; k++) {
- System.out.println(impar.elements[k]);
- }
- }
- }
- package ex003;
- public class nha {
- public static void main(String[] args) {
- Pilha p = new Pilha();
- p.push(1);
- p.push(2);
- p.push(3);
- p.push(4);
- p.reorganizar(p);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement