双向循环链表（插入，删除，就地逆置）

1. package design;
3. import java.util.Scanner;
5. //循环双链表
6. public class LinkedList<AnyType> {
7. private int theSize;
8. private Node<AnyType> beginMarker;
9. private Node<AnyType> endMarker;
11. class Node<AnyType>{ //定义匿名类Node
12. public AnyType data;
13. public Node<AnyType> prev;
14. public Node<AnyType> next;
15. public Node(AnyType d,Node<AnyType> p,Node<AnyType> n){
16. this.data=d;
17. this.prev=p;
18. this.next=n;
19. }
21. }
23. public LinkedList(){ //构造方法
24. beginMarker= new Node<AnyType>( null,endMarker,endMarker);
25. endMarker= new Node<AnyType>( null,beginMarker,beginMarker);
26. beginMarker.next=endMarker;
27. theSize= 0;
28. }
29. public int size(){
30. return theSize;
31. }
32. public Node<AnyType> getNode(int idx){ //返回idx对应的结点
33. Node<AnyType> p= null;
34. if(idx< 0||idx>size())
35. System.out.println( “无法找到该点”);
37. if(idx<size()/ 2){
38. p=beginMarker.next;
39. for( int i= 0;i<idx;i++)
40. p=p.next;
41. }
42. else{
43. p=endMarker;
44. for( int i=size();i>idx;i–)
45. p=p.prev;
46. }
48. return p;
49. }
51. public boolean add(AnyType x){ //插入元素
52. add(size(),x);
53. return true;
54. }
55. private void add(int idx,AnyType x){
56. if(idx>size()||idx< 0){
57. System.out.println( “输入错误”);
58. } else{
59. Node<AnyType> p;
60. p=getNode(idx);
61. Node<AnyType> newNode= new Node<AnyType>(x,p.prev,p);
62. newNode.prev.next=newNode;
63. p.prev=newNode;
64. theSize++;
65. }
66. }
67. public AnyType remove(int idx){ //删除元素
68. if(idx>size()||idx< 0){
69. System.out.println( “无法找到该节点”);
70. return null;
71. } else
72. return remove(getNode(idx));
73. }
74. public AnyType remove(Node<AnyType> p){
75. p.next.prev=p.prev;
76. p.prev.next=p.next;
77. theSize–;
78. return p.data;
79. }
80. public void addFirst(AnyType data){
81. add( 0,data);
82. }
83. public void addLast(AnyType data){
84. add(size(),data);
85. }
86. public void trs(){
87. Node p=beginMarker;
88. while(p.next!=beginMarker){
89. Node q=p;
90. Node r=p.next;
91. q.next=q.prev;
92. q.prev=r;
93. p=p.prev;
94. }
95. Node q=p;
96. Node r=p.next;
97. q.next=q.prev;
98. q.prev=r;
99. Node s=beginMarker;
100. beginMarker=endMarker;
101. endMarker=s;
103. int i= 0;
104. for(Node x=beginMarker.next;x!=endMarker;x=x.next){
105. System.out.println(i+ ": “+x.data);
106. i++;
107. }
108. i= 0;
109. }
110. public void print(){
111. int i= 0;
112. for(Node x=beginMarker.next;x.next!=beginMarker;x=x.next){
113. System.out.println(i+ ”: "+x.data);
114. i++;
115. }
116. i= 0;
117. }
118. public static void main(String[] args) {
119. //验证部分
120. LinkedList<String> La= new LinkedList<String>();
121. System.out.println( “1：创建链表”);
122. System.out.println( “2：添加结点”);
123. System.out.println( “3：删除结点”);
124. System.out.println( “4：添加第一个”);
125. System.out.println( “5：添加最后一个”);
126. System.out.println( “6 ：转置”);
127. System.out.println( “请输入要进行的操作”);
128. Scanner sc= new Scanner(System.in);
129. boolean flag= true;
130. while(flag){
131. System.out.println( “请输入您的要进行的操作：”);
132. int c=sc.nextInt();
133. switch©{
134. case 1: System.out.println( “请输入数据个数”);
135. int n=sc.nextInt();
136. System.out.println( “输入数据”);
137. for( int i= 0;i<n;i++){
138. String data=sc.next();
139. La.add(data);
140. }
141. La.print();
142. break;
143. case 2: System.out.println( “输入数据的插入位置和数据”);
144. int w=sc.nextInt();
145. String data=sc.next();
146. La.add(w,data);
147. La.print();
148. break;
149. case 3: System.out.println( “输入要删除结点的位置”);
150. int q=sc.nextInt();
151. La.remove(q);
152. La.print(); break;
153. case 4: System.out.println( “输入要添加的数据”);
154. String d=sc.next();
155. La.addFirst(d);
156. La.print(); break;
157. case 5: System.out.println( “输入要添加的数据”);
158. String da=sc.next();
159. La.addLast(da);
160. La.print(); break;
161. case 6: La.trs();
162. break;
163. default :System.out.println( “您输错了，请重新输入”); break;
164. }
165. }
167. }
169. }