1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127
| package stack;
import java.util.Scanner;
public class StackTest { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(System.in); Stack S = new Stack(); StackMenu M = new StackMenu(); StackAlgorithm A = new StackAlgorithm(); M.display(); while(true) { int N; System.out.println("请输入您要选择的操作序号:"); N = sc.nextInt(); switch(N) { case 1: int x; System.out.println("请输入一个数据(以0结束):"); x = sc.nextInt(); while(x!=0) { if(A.stack_IsFull(S)!=true) { A.stack_Push(S, x); }else { break; } System.out.println("请输入一个数据(以0结束):"); x = sc.nextInt(); } break; case 2: int t = A.stack_GetTop(S); A.stack_Pop(S); System.out.println("出栈结果为:"+t); break; case 4: System.out.println("请输入你要转换的进制数(2,8,16):"); int m = sc.nextInt(); System.out.println("请输入一个十进制数据:"); x = sc.nextInt(); while(x>0) { t = x%m; A.stack_Push(S, t); x = x/m; } while(A.stack_IsNull(S)!=true) { t = A.stack_GetTop(S); if(t<10) { System.out.print(t); }else { switch(t) { case 10: System.out.print("A"); break; case 11: System.out.print("B"); break; case 12: System.out.print("C"); break; case 13: System.out.print("D"); break; case 14: System.out.print("E"); break; case 15: System.out.print("F"); break; default: return; } } A.stack_Pop(S); } System.out.println(); break; case 6: while(!A.stack_IsNull(S)) { A.stack_Pop(S); } System.out.println("请连续输入字符序列,以#结束:"); char c = (char)System.in.read(); boolean key = true; while(c!='#') { if(c=='(') { A.stack_Push(S, c); }else if(c==')') { if(!A.stack_IsNull(S)) { A.stack_Pop(S); }else { key = false; } } c = (char)System.in.read(); } if(A.stack_IsNull(S) ) { if(key) { System.out.println("匹配!"); }else { System.out.println("不匹配!"); } }else if(!A.stack_IsNull(S)) { System.out.println("不匹配!"); } break; default: return; } } } }
|