Java da Stack Algoritmasi

Java

public class MyStack {
   private int maxSize;
   private long[] stackArray;
   private int top;
   
   public MyStack(int s) {
      maxSize = s;
      stackArray = new long[maxSize];
      top = -1;
   }
   public void push(long j) {
      stackArray[++top] = j;
   }
   public long pop() {
      return stackArray[top--];
   }
   public long peek() {
      return stackArray[top];
   }
   public boolean isEmpty() {
      return (top == -1);
   }
   public boolean isFull() {
      return (top == maxSize - 1);
   }
}

Similar Posts:
  1. Java Annotations
  2. Java Covariant Return Type
  3. Java Enum

Tags: java, java algoritma, java algoritmalari, java başlangıç, java dizi, java dizi algoritması, java stack algoritmasi