[java소스] ChainNode ( 링크드리스트) 채인노드 예제

어렵지 않은 코드라 보시는데 어려움 없을듯 ..^^ 

import java.util.*; public class Chain { // data members protected ChainNode firstNode; protected int size; // constructors /** create a list that is empty */ public Chain(int initialCapacity) { firstNode = null ; size = initialCapacity ; } public Chain() {this(0);} // methods /** @return true iff list is empty */ public boolean isEmpty() {return size == 0;} /** @return current number of elements in list */ public int size() {return size;} /** @throws IndexOutOfBoundsException when * index is not between 0 and size - 1 */ void checkIndex(int index) { if (index < 0 || index >= size) throw new IndexOutOfBoundsException ("index = " + index + " size = " + size); } /** @return element with specified index * @throws IndexOutOfBoundsException when * index is not between 0 and size - 1 */ public Object get(int index) { checkIndex(index); // move to desired node ChainNode currentNode = firstNode; for (int i = 0; i < index; i++) currentNode = currentNode.next; return currentNode.element; } /** @return index of first occurrence of theElement, * return -1 if theElement not in list */ public int indexOf(Object theElement) { // search the chain for theElement ChainNode currentNode = firstNode; int index = 0; // index of currentNode while (currentNode != null && !currentNode.element.equals(theElement)) { // move to next node currentNode = currentNode.next; index++; } // make sure we found matching element if (currentNode == null) return -1; else return index; } /** Remove the element with specified index. * All elements with higher index have their * index reduced by 1. * @throws IndexOutOfBoundsException when * index is not between 0 and size - 1 * @return removed element */ public Object remove(int index) { checkIndex(index); Object removedElement; if (index == 0) // remove first node { removedElement = firstNode.element; firstNode = firstNode.next; } else { // use q to get to predecessor of desired node ChainNode q = firstNode; for (int i = 0; i < index - 1; i++) q = q.next; removedElement = q.next.element; q.next = q.next.next; // remove desired node } size--; return removedElement; } /** Insert an element with specified index. * All elements with equal or higher index * have their index increased by 1. * @throws IndexOutOfBoundsException when * index is not between 0 and size */ public void add(int index, Object theElement) { if (index < 0 || index > size) // invalid list position throw new IndexOutOfBoundsException ("index = " + index + " size = " + size); if (index == 0) // insert at front firstNode = new ChainNode(theElement, firstNode); else { // find predecessor of new element ChainNode p = firstNode; for (int i = 0; i < index - 1; i++) p = p.next; // insert after p p.next = new ChainNode(theElement, p.next); } size++; } /** convert to a string */ public String toString() { StringBuffer s = new StringBuffer("["); // put elements into the buffer ChainNode currentNode = firstNode; while(currentNode != null) { if (currentNode.element == null) s.append("null, "); else s.append(currentNode.element.toString() + ", "); currentNode = currentNode.next; } if (size > 0) s.delete(s.length() - 2, s.length()); // remove last ", " s.append("]"); // create equivalent String return new String(s); } } ------------------------------------------------------------------- public class ChainNode { // package visible data members Object element; ChainNode next; // package visible constructors ChainNode() {} ChainNode(Object element) {this.element = element;} ChainNode(Object element, ChainNode next) {this.element = element; this.next = next;} } ------------------------------------------------------------------- import java.util.*; public class ChainTest { /** test program */ public static void main(String [] args) { // test default constructor Chain x = new Chain(); // test size System.out.println("Initial size is " + x.size()); // test isEmpty if (x.isEmpty()) System.out.println("The list is empty"); else System.out.println("The list is not empty"); // test put x.add(0, new Integer(2)); x.add(1, new Integer(6)); x.add(0, new Integer(1)); x.add(2, new Integer(4)); System.out.println("List size is " + x.size()); // test toString System.out.println("The list is " + x); // test indexOf int index = x.indexOf(new Integer(4)); if (index < 0) System.out.println("4 not found"); else System.out.println("The index of 4 is " + index); index = x.indexOf(new Integer(3)); if (index < 0) System.out.println("3 not found"); else System.out.println("The index of 3 is " + index); // test get System.out.println("Element at 0 is " + x.get(0)); System.out.println("Element at 3 is " + x.get(3)); // test remove System.out.println(x.remove(1) + " removed"); System.out.println("The list is " + x); System.out.println(x.remove(2) + " removed"); System.out.println("The list is " + x); if (x.isEmpty()) System.out.println("The list is empty"); else System.out.println("The list is not empty"); System.out.println("List size is " + x.size()); } }