質問編集履歴

追加

2017/08/13 06:46

投稿

DAISUKE0549

スコア12

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -216,47 +216,89 @@
 103.	}
-   public static void main(String[] args) {
-		LinkedList<Data> list = new LinkedList<Data>();
-		Data d1 = new Data(1, "sayama");
-		Data d2 = new Data(2, "aki");
-		Data d3 = new Data(3, "sayama");
-		Data d4 = new Data(4, "akagi");
-		Data d5 = new Data(5, "sayama");
-		list.addFirst(d1);
-		list.addLast(d2);
-		list.addLast(d3);
-		list.addLast(d4);
-		list.addLast(d5);
-		System.out.println(Data.NAME_ORDER.compare(d1, d3));
-		list.dump();
-		System.out.println("名前でパージします");
-		list.purge(Data.NAME_ORDER);
-		System.out.println();
-		list.dump();
-	}
- }
+104. // 末尾にノードを挿入
+105. public void addLast(E obj) {
+106.		if (head == null) { // リストが空であれば
+107.			addFirst(obj); // 先頭に挿入
+108.		} else {
+109.			Node<E> ptr = head;
+110.			// 末尾ノードを見つける処理
+111.			while (ptr.next != null) {
+112.				ptr = ptr.next;
+113.			}
+114.			ptr.next = crnt = new Node<E>(obj, null);
+115.		}
+116.	}
+117.// 全ノードを表示
+118.	public void dump() {
+119.		Node<E> ptr = head;
+120.		while (ptr != null) {
+121.			System.out.println(ptr.data);
+122.			ptr = ptr.next;
+123.		}
+124.	}
+125.
+130.   public static void main(String[] args) {
+131.		LinkedList<Data> list = new LinkedList<Data>();
+132.		Data d1 = new Data(1, "sayama");
+133.		Data d2 = new Data(2, "aki");
+134.		Data d3 = new Data(3, "sayama");
+135.		Data d4 = new Data(4, "akagi");
+136.		Data d5 = new Data(5, "sayama");
+137.		list.addFirst(d1);
+138.		list.addLast(d2);
+139.		list.addLast(d3);
+140.		list.addLast(d4);
+141.		list.addLast(d5);
+142.		System.out.println(Data.NAME_ORDER.compare(d1, d3));
+143.		list.dump();
+144.		System.out.println("名前でパージします");
+145.		list.purge(Data.NAME_ORDER);
+146.		System.out.println();
+147.		list.dump();
+148.	}
+149. }