Node y = new Node(); y.setData(new String(x.getData())); y.setNext(null);
public static void addNode(Node list) { Scanner ui = new Scanner(System.in); System.out.println("A ninth planet has been found! What is it's name?"); String userInput = ui.nextLine(); Node curr = list; while (cur.next != null) { curr = curr.getNext(); } curr.setNext(new Node(userInput, null)); }//end method
Node temp = head; head = new Node("Jim", 541365250);
public class RecLinkedList { private int size = 0; //... private Node add( String s, Node list){ if( list == null ){ this.size += 1; return new Node(s); }else{ list.setNext( add( s, list.getNext() ) ); return list; } } //... }
public class LinkedList { private Node head; public LinkedList() { head = new Node(0); } public LinkedList(Node node) { head = node; } public void add(Node node) { Node ptr = head; while ( ptr.getNext() != null ) { ptr = ptr.getNext(); } ptr.setNext(node); } ... /// added removeSecondAppear here, but left out to keep it short(er) // provided a print() method }
public void add(Object data) { Node temp = new Node(data); Node curr = head; if (curr == null) { // if the list be empty, assign the head head = temp; } else { // otherwise walk down the list until hitting the end while (curr.getNext() != null) { curr = curr.getNext(); } // and the insert the new node curr.setNext(temp); } return; }
public class MyLinkedList { Node start; public void insertAtEnd(int data) { Node newNode = new Node(data); if (start == null) { start = newNode; return; } Node traverse = start; while (traverse.getNext() != null) { traverse = traverse.getNext(); } traverse.setNext(newNode); } public void traverse() { if (start == null) System.out.println("List is empty"); else { Node tempNode = start; do { System.out.print(tempNode.getData() + " "); tempNode = tempNode.getNext(); } while (tempNode != null); System.out.println(); } }
public void add(String item, int pos) { if (pos > length) { // Probably just throw an out of bounds exception } Node existingNode = head; for (int i = 0; i < pos; i++) existingNode = existingNode.getNext(); Node newNode = new Node(item); newNode.setNext(existingNode.getNext()); existingNode.setNext(newNode); }
public boolean replace(int element, int index) { Node head = getHead(); int counter = 0; while(null != head && counter++ < index - 1) { head = head.getNext(); } if(null == head || null == head.getNext()) return false; Node newNode = new Node(element); newNode.setNext(head.getNext().getNext()); head.setNext(newNode); return true; }
// head.getNext() == head Node head = new Node(); public void timeSlice(int cpuTime) { Node prev = head; // A dummy at head. Node curr = prev.getNext(); for ( ; curr != head; prev = curr, curr = curr.getNext()) { // ... if (/* remove? */) { removeNext(prev); curr = prev; } } } public void removeNext(Node node) { node.setNext(node.getNext().getNext()); }
public void sortedAdd(Item newItem) { Node dummy = head; if(dummy==null) { head = new Node(); head.setItem(newItem); head.setNext(null); head.setPrev(head); } else { Node current = dummy.getNext(); while ((newItem.compareTo(current.getItem()) > 0) && (current != dummy)) current = current.getNext(); Node temp = new Node(); temp.setNext(current); temp.setPrev(current.getPrev()); (current.getPrev()).setNext(temp); current.setPrev(temp); temp.setItem(newItem); } ++numberOfEelements; }
public void add(String data){ Node linkedTemp = new Node(data); Node linkedCurrent = head; Node linkedPrev = head; while ( linkedCurrent != null ) { if ( linkedCurrent.getData() != null && linkedCurrent.getData().compareTo(data) > 0 ) { break; } linkedPrev = linkedCurrent; linkedCurrent = linkedCurrent.getNext(); } linkedTemp.setNext( linkedPrev.getNext() ); linkedPrev.setNext(linkedTemp); listCount++; }
public void product(Node curr) { if (curr.getNext() == null) { return; } else { int data = curr.getData() * curr.getNext().getData(); Node newNode = new Node(); newNode.setData(data); Node nodeAfterNextNode = curr.getNext().getNext(); newNode.setNext(nodeAfterNextNode); curr.setNext(newNode); product(newNode); } }
Node temp = new Node(data); Node current = head; Node previous = null;
Node temp = new Node(data);