poo

Author: brunobelloni

Hanoi/generateDisks.hpp

@@ -26,7 +26,7 @@ int getDisks() {
 
 int getJogadas(Stack *stack, int disks) {
     for(int i = disks; i >= 1; i--) {
-        push(stack, i);
+        stack->push(i);
     }
 
     int difficulty = 1;

Hanoi/play.hpp

@@ -2,29 +2,32 @@
 
 enum TYPE {
     ORIGIN,
-    DESTINY,
     WORK,
+    DESTINY,
 };
 
-void logic(Stack context, Stack helper1, Stack helper2) {
-
+bool logic(Stack *toPop, Stack *toPush) {
+    if(toPop->peek() < toPush->peek() || toPush->underflow()) {
+        int popValue = toPop->pop();
+        toPush->push(popValue);
+        return true;
+    }
 
+    return false;
 }
 
 bool playLogic(Stack *leftStack, Stack *centerStack, Stack *rightStack) {
     string firstChoice;
     string secondChoice;
     int popValue;
 
-    cout << "     [O]rigem        [T]rabalho        [D]estino" << endl;
+    cout << "     Origem[O]       Trabalho[T]      Destino[D]" << endl;
     cout << "\nEscolha a pilha de onde deseja retirar um disco: ";
     getline(cin, firstChoice);
     fflush(stdin);
 
-
-
     if(firstChoice == "o" || firstChoice == "O") {
-        if(underflow(leftStack)) {
+        if(leftStack->underflow()) {
             return false;
         }
 
@@ -33,80 +36,47 @@ bool playLogic(Stack *leftStack, Stack *centerStack, Stack *rightStack) {
         getline(cin, secondChoice);
         fflush(stdin);
 
+
         if(secondChoice == "t" || secondChoice == "T") {
-            if(peek(leftStack) < peek(centerStack) || underflow(centerStack)) {
-                popValue = pop(leftStack);
-                push(centerStack, popValue);
-                return true;
-            } else {
-                return false;
-            }
+            return logic(leftStack, centerStack);
         } else if(secondChoice == "d" || secondChoice == "D") {
-            if(peek(leftStack) < peek(rightStack) || underflow(rightStack)) {
-                popValue = pop(leftStack);
-                push(rightStack, popValue);
-                return true;
-            } else {
-                return false;
-            }
+            return logic(leftStack, rightStack);
         } else {
             return false;
         }
 
     } else if(firstChoice == "t" || firstChoice == "T") {
-        if(underflow(centerStack))
+        if(centerStack->underflow()) {
             return false;
+        }
 
         cout << "\nVocê escolheu remover um disco do TRABALHO!" << endl;
         cout << "\nEscolha para onde deseja enviar o disco: ";
         getline(cin, secondChoice);
         fflush(stdin);
 
         if(secondChoice == "o" || secondChoice == "O") {
-            if(peek(centerStack) < peek(leftStack) || underflow(leftStack)) {
-                popValue = pop(centerStack);
-                push(leftStack, popValue);
-                return true;
-            } else {
-                return false;
-            }
+            return logic(centerStack, leftStack);
         } else if(secondChoice == "d" || secondChoice == "D") {
-            if(peek(centerStack) < peek(rightStack) || underflow(rightStack)) {
-                popValue = pop(centerStack);
-                push(rightStack, popValue);
-                return true;
-            } else {
-                return false;
-            }
+            return logic(centerStack, rightStack);
         } else {
             return false;
         }
     }
     if(firstChoice == "d" || firstChoice == "D") {
-        if(underflow(rightStack))
+        if(rightStack->underflow()) {
             return false;
+        }
 
         cout << "\nVocê escolheu remover um disco do DESTINO!" << endl;
         cout << "\nEscolha para onde deseja enviar o disco: ";
         getline(cin, secondChoice);
         fflush(stdin);
 
         if(secondChoice == "t" || secondChoice == "T") {
-            if(peek(rightStack) < peek(centerStack)|| underflow(centerStack)) {
-                popValue = pop(rightStack);
-                push(centerStack, popValue);
-                return true;
-            } else {
-                return false;
-            }
+            return logic(rightStack, centerStack);
         } else if(secondChoice == "o" || secondChoice == "O") {
-            if(peek(rightStack) < peek(leftStack) || underflow(leftStack)) {
-                popValue = pop(rightStack);
-                push(leftStack, popValue);
-                return true;
-            } else {
-                return false;
-            }
+            return logic(rightStack, leftStack);
         } else {
             return false;
         }

Main.cpp

@@ -12,10 +12,6 @@ int main() {
 
     Stack leftStack, centerStack, rightStack;
 
-    set(&leftStack);
-    set(&centerStack);
-    set(&rightStack);
-
     leftStack.disks = centerStack.disks = rightStack.disks = getDisks();
 
     int remainingPlays = getJogadas(&leftStack, leftStack.disks);
@@ -30,7 +26,7 @@ int main() {
             getchar();
         }
 
-        if(overflow(&rightStack)) {
+        if(rightStack.overflow()) {
             showAll(&leftStack, &centerStack, &rightStack, remainingPlays, true);
             cout << "\nVocê venceu o jogo, Parabéns!!!!" << endl;
             break;

Stack.hpp

@@ -1,49 +1,55 @@
 #define TAM 8
 
-struct Stack {
+class Stack {
+public:
     int disks;
     int sizeT;
     int top;
     int base;
     int data[TAM];
-};
 
-void set(Stack *stack) {
-    stack->sizeT = TAM;
-    stack->base = -1;
-    stack->top = stack->base;
+    Stack() {
+        sizeT = TAM;
+        base = -1;
+        top = base;
+
+        for(int i = 0; i < sizeT; i++) {
+            data[i] = NULL;
+        }
+    }
+
+    bool overflow() {
+        return (top == (disks - 1)) ? true : false;
+    }
 
-    for(int i = 0; i < stack->sizeT; i++) {
-        stack->data[i] = NULL;
+    bool underflow() {
+        return (top == base) ? true : false;
     }
-}
 
-bool overflow(Stack *stack) {
-    return (stack->top == (stack->disks - 1)) ? true : false;
-}
+    void push(int num) {
+        top = top + 1;
+        data[top] = num;
+    }
 
-bool underflow(Stack *stack) {
-    return (stack->top == stack->base) ? true : false;
-}
+    int pop() {
+        int value = NULL;
 
-void push(Stack *stack, int num) {
-    stack->top = stack->top + 1;
-    stack->data[stack->top] = num;
-}
+        if (!underflow()) {
+            value = data[top];
+            data[top] = NULL;
+            top--;
+        }
 
-int pop(Stack *stack) {
-    int value = NULL;
+        return value;
+    }
 
-    if (!underflow(stack)) {
-        value = stack->data[stack->top];
-        stack->data[stack->top] = NULL;
-        stack->top--;
+    int peek() {
+        return !underflow() ? data[top] : -1;
     }
+};
+
+
+
+
 
-    return value;
-}
 
-int peek(Stack *stack) {
-    if(!underflow(stack))
-        return (stack->data[stack->top]);
-}