Java Double Stack
Selasa, 15 Juli 2014
Add Comment
import java.util.Scanner;
public class doublestack
{
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int top1,top2,n,pil;
int A[]=new int[10];
top1=-1;
top2=9 ;
n=10;
do
{
System.out.println("\n 1. push stack 1");
System.out.println(" 2. push stack 2");
System.out.println(" 3. pop stack 1");
System.out.println(" 4. pop stack 2");
System.out.println(" 0. Exit");
System.out.print(" masukan pilihan : ");
pil=scan.nextInt();
switch(pil)
{
case 1 :
{
if(top2-top1>1)
{
top1=top1+1;
System.out.print(" input data :");
A[top1]=scan.nextInt();
}
else
{ System.out.println("stack penuh");}
for(int a=0;a<9;a++)
{
System.out.print(" "+A[a]);
}
}break;
case 2 :
{
if(top2-top1>1)
{
top2=top2-1;
System.out.print(" input data : ");
A[top2]=scan.nextInt();
for(int a=0;a<9;a++)
{
System.out.print(" "+A[a]);
}
}
else
{ System.out.println(" stack penuh");}
}break;
case 3 :
{
if(top1>-1)
{
A[top1]=0;
for(int a=0;a<9;a++)
{
System.out.print(" "+A[a]);
}
top1=top1-1;
}
else
{ System.out.println("stack kosong");}
}break;
case 4 :
{
if(top2<n)
{
A[top2]=0;
for(int a=0;a<9;a++)
{
System.out.print(" "+A[a]);
}
top2=top2+1;
}
else
{ System.out.println("stack kosong");}
}
}
}
while(pil!=0);
}
}
public class doublestack
{
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int top1,top2,n,pil;
int A[]=new int[10];
top1=-1;
top2=9 ;
n=10;
do
{
System.out.println("\n 1. push stack 1");
System.out.println(" 2. push stack 2");
System.out.println(" 3. pop stack 1");
System.out.println(" 4. pop stack 2");
System.out.println(" 0. Exit");
System.out.print(" masukan pilihan : ");
pil=scan.nextInt();
switch(pil)
{
case 1 :
{
if(top2-top1>1)
{
top1=top1+1;
System.out.print(" input data :");
A[top1]=scan.nextInt();
}
else
{ System.out.println("stack penuh");}
for(int a=0;a<9;a++)
{
System.out.print(" "+A[a]);
}
}break;
case 2 :
{
if(top2-top1>1)
{
top2=top2-1;
System.out.print(" input data : ");
A[top2]=scan.nextInt();
for(int a=0;a<9;a++)
{
System.out.print(" "+A[a]);
}
}
else
{ System.out.println(" stack penuh");}
}break;
case 3 :
{
if(top1>-1)
{
A[top1]=0;
for(int a=0;a<9;a++)
{
System.out.print(" "+A[a]);
}
top1=top1-1;
}
else
{ System.out.println("stack kosong");}
}break;
case 4 :
{
if(top2<n)
{
A[top2]=0;
for(int a=0;a<9;a++)
{
System.out.print(" "+A[a]);
}
top2=top2+1;
}
else
{ System.out.println("stack kosong");}
}
}
}
while(pil!=0);
}
}
0 Response to "Java Double Stack"
Posting Komentar