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 128 129 130 131 132 133 134 135 136 137 138
| package link;
import java.util.Scanner;
import line.LineMenu;
public class LinkTest { public static void main(String[] args) { Scanner sc = new Scanner(System.in); LinkAlgorithm A = new LinkAlgorithm(); Link Head = A.link_Ininal(); int N; LinkMenu M = new LinkMenu(); M.display(); while(true) { System.out.println("请输入您操作的序号:"); N = sc.nextInt(); switch(N) { case 1: M.found(); char c; System.out.println("请选择您创建链表的方法对应的字母"); c = sc.next().charAt(0); switch(c) { case 'a': case 'A': int x; Link p; System.out.println("请输入数据(0结束):"); x = sc.nextInt(); while(x!=0) { p = A.link_New(x); A.link_Setnext(p, A.link_Getnext(Head)); A.link_Setnext(Head, p); System.out.println("请输入数据(0结束):"); x = sc.nextInt(); } A.link_Print(Head); break; case 'b': case 'B': System.out.println("请输入数据(0结束):"); x = sc.nextInt(); Link q; p = A.link_Getend(Head); while(x!=0) { q = A.link_New(x); A.link_Setnext(p, q); p = A.link_Getnext(p); System.out.println("请输入数据(0结束):"); x = sc.nextInt(); } A.link_Print(Head); break; default: return; } break; case 2: A.link_Print(Head); break; case 3: System.out.println("请输入要插入的值:"); int value = sc.nextInt(); System.out.println("将该值插入到哪个值后:"); int num = sc.nextInt(); Link o = A.link_New(value); Link p = A.link_Search(Head, num); A.link_Setnext(o, p.getNext()); A.link_Setnext(p, o); break; case 4: System.out.println("请输入要删除的值:"); int x = sc.nextInt(); Link q; p = A.link_Getnext(Head); q = Head; while(p!=null) { if(A.link_Getdata(p)==x) { break; } q = p; p = A.link_Getnext(p); } if(p!=null) { A.link_Setnext(q, A.link_Getnext(p)); }else { System.out.println("没有找到"); } break; case 7: Link Head1 = A.link_Ininal(); while(A.link_Getnext(Head)!=null) { p = A.link_Getnext(Head); A.link_Setnext(Head, A.link_Getnext(p)); A.link_Setnext(p, A.link_Getnext(Head1)); A.link_Setnext(Head1, p); } A.link_Print(Head1); break; default: return; } } } }
|