01204212/codes/linked lists - ประวัติรุ่นแก้ไข

Jittat เมื่อ 14:14, 13 กันยายน 2559

2016-09-13T14:14:48Z

2016-09-10T00:11:45Z

Generic list (with iterator)

2016-09-09T23:44:08Z

Generic list (with iterator)

2016-09-08T05:16:16Z

Generic list (with iterator)

2016-09-07T21:53:38Z

2016-09-07T21:49:39Z

2016-09-07T07:52:09Z

Generic list (with iterator)

2016-09-07T07:49:58Z

Generic linked lists (no iterator)

2016-09-07T07:15:28Z

Generic linked lists

2016-09-07T07:14:45Z

Generic linked lists

@@ แถว 58: / แถว 58: @@
 			newNode.next = head;
 			head = newNode;
 			return newNode;
+		}
@@ แถว 151: / แถว 152: @@
 			newNode.next = head;
 			head = newNode;
 			return newNode;
+		}

@@ แถว 229: / แถว 229: @@
+		}
-		T getVal() {
+		public T getVal() {
 			return currentNode.getVal();
+		}
-		void setVal(T v) {
+		public void setVal(T v) {
 			currentNode.setVal(v);
+		}
-		void next() {
+		public void next() {
 			currentNode = currentNode.getNext();
+		}

@@ แถว 231: / แถว 231: @@
 		T getVal() {
 			return currentNode.getVal();
+		}
 		void next() {
 			currentNode = currentNode.getNext();
+		}

@@ แถว 280: / แถว 280: @@
 	public void removeHead() {
-		if (head != null) {
+		// ...
+	}

@@ แถว 44: / แถว 44: @@
 	public boolean isEmpty() {
-		return tail != null;
+		return tail == null;
+	}
@@ แถว 137: / แถว 137: @@
 	public boolean isEmpty() {
-		return tail != null;
+		return tail == null;
+	}
@@ แถว 261: / แถว 261: @@
 	public boolean isEmpty() {
-		return tail != null;
+		return tail == null;
+	}

@@ แถว 10: / แถว 10: @@
 	public class Node {
 		private int val;
-		private Node next = null;
+		protected Node next = null;
 		public Node(int val) {
@@ แถว 103: / แถว 103: @@
 	public class Node {
 		private T val;
-		private Node next = null;
+		protected Node next = null;
 		public Node(T val) {
@@ แถว 196: / แถว 196: @@
 	private class Node {
 		private T val;
-		private Node next = null;
+		protected Node next = null;
 		public Node(T val) {

@@ แถว 247: / แถว 247: @@
 		public void removeAfter() {
+		}
+	}
@@ แถว 267: / แถว 268: @@
+	}
-	public Node addHead(T v) {
+	public Iterator addHead(T v) {
 		if (isEmpty()) {
 			return add(v);
@@ แถว 274: / แถว 275: @@
 			newNode.next = head;
 			head = newNode;
-			return newNode;
+			return new Iterator(newNode, this);
+		}
+	}
@@ แถว 289: / แถว 290: @@
+	}
-	public Node add(T v) {
+	public Iterator add(T v) {
 		Node newNode = new Node(v);
@@ แถว 300: / แถว 301: @@
 		size++;
-		return newNode;
+		return new Iterator(newNode, this);
+	}

@@ แถว 186: / แถว 186: @@
 	public Node getHead() {
 		return head;
+	}
+}
 </syntaxhighlight>

@@ แถว 97: / แถว 97: @@
 </syntaxhighlight>
-== Generic linked lists ==
+== Generic linked lists (no iterator) ==
 <syntaxhighlight lang="java">
 public class LinkedList<T> {

←รุ่นแก้ไขก่อนหน้า		รุ่นแก้ไขเมื่อ 07:14, 7 กันยายน 2559
แถว 98:		แถว 98:

	== Generic linked lists ==		== Generic linked lists ==
		+	<syntaxhighlight lang="java">
		+	public class LinkedList<T> {
		+
		+	public class Node {
		+	private T val;
		+	private Node next = null;
		+
		+	public Node(T val) {
		+	this.val = val;
		+	this.next = null;
		+	}
		+
		+	public Node() {
		+	this(null);
		+	}
		+
		+	public Node getNext() {
		+	return next;
		+	}
		+
		+	public T getVal() {
		+	return val;
		+	}
		+
		+	public void setVal(T v) {
		+	val = v;
		+	}
		+	}
		+
		+	private Node head = null;
		+	private Node tail = null;
		+	private int size = 0;
		+
		+	public LinkedList() {
		+	head = tail = null;
		+	size = 0;
		+	}
		+
		+	public boolean isEmpty() {
		+	return tail != null;
		+	}
		+
		+	public int size() {
		+	return size;
		+	}
		+
		+	public Node addHead(T v) {
		+	if (isEmpty()) {
		+	return add(v);
		+	} else {
		+	Node newNode = new Node(v);
		+	newNode.next = head;
		+	head = newNode;
		+	return newNode;
		+	}
		+	}
		+
		+	public void removeHead() {
		+	// ...
		+	}
		+
		+	public Node add(T v) {
		+	Node newNode = new Node(v);
		+
		+	if (!isEmpty()) {
		+	tail.next = newNode;
		+	tail = newNode;
		+	} else {
		+	head = tail = newNode;
		+	}
		+
		+	size++;
		+	return newNode;
		+	}
		+
		+	public Node addAfter(Node node, T v) {
		+	// ...
		+	}
		+
		+	public void removeAfter(Node node) {
		+	if (node.next != null) {
		+	node.next = node.next.next;
		+	size--;
		+	}
		+	}
		+
		+	public Node getHead() {
		+	return head;
		+	}
		+	}
		+	</syntaxhighlight>