試圖讓這個鏈表開始

Question

第二個編程類 所以我們一直負責鏈接列表，從頭開始構建每個方法。 那麼我在昨天的這一天開始，並有一個空指針的例外，我認爲id後來並繼續。 好了切斷我的程序後，沒有找到罪魁禍首即時離開與代碼，應該工作，因爲它從我們的實驗室複製（工作）。 如果你們認爲你可以弄清楚爲什麼即時通訊我的add方法id得到一個空指針異常非常感謝它，看看我是否正確地做第二個構造函數。如果我能夠在這方面獲得一些啓發，它會變得更加容易，但是因爲我甚至不能開始。

你會發現的空白方法配發，病得到過他們，我可以讓我的構造函數+ add方法工作

我的代碼：

import java.util.Collection; 
import java.util.Iterator; 

/** 
* Created by hhhh on 11/2/2014. 
*/ 
public class Lset<R> implements Set151Interface<R> { 

    private Node head; 
    private int  length; 

    /**In the first (following) constructor im trying to re use code and call my clear method. 
    *Should save space and make code look cleaner. 
    */ 
    public Lset(){ 
     clear(); 
    } 

    public Lset(Collection<? extends R> list){ 
     this(); 
     for (R object : list) { 
      add(object); 
     } 


    } 

    /** 
    * Copied from Lab7, this add method checks to see if there are more nodes than just the head. 
    * After the check if false, creates a new node and adds it to the end of the list. 
    * @param entry 
    * @return 
    */ 
    @Override 
    public boolean add(R entry) { 
     Node newNode = new Node(entry); 

     // empty list is handled differently from a non-empty list 
     if (head.next == null) { 
      head = newNode; 
     } else { 
      Node lastNode = getNodeAt(length - 1); 
      lastNode.next = newNode; 
     } 
     length++; 
     return true; 
    } 

    @Override 
    public void clear() { 
     this.length  = 0; 
     this.head  = null; 
    } 

    @Override 
    public boolean contains(Object o) { 
     return false; 
    } 

    @Override 
    public Iterator<R> iterator() { 
     return null; 
    } 

    @Override 
    public boolean containsAll(Collection<?> c) { 
     return false; 
    } 

    @Override 
    public boolean isEmpty() { 
     return false; 
    } 

    @Override 
    public boolean remove(Object o) { 
     return false; 
    } 

    @Override 
    public boolean addAll(Collection<? extends R> c) { 
     return false; 
    } 

    @Override 
    public boolean removeAll(Collection<?> c) { 
     return false; 
    } 

    @Override 
    public boolean retainAll(Collection<?> c) { 
     return false; 
    } 

    @Override 
    public int size() { 
     return length; 
    } 

    @Override 
    public Object[] toArray() { 
     return null; 
    } 

    @Override 
    public <T> T[] toArray(T[] array) { 
     return null; 
    } 


    /** 
    * Code used in Lab 7, getNodeAt uses the length field and starts at head to traverse array and arrive at the 
    * position desired. 
    * @param position 
    * @return 
    */ 
    private Node getNodeAt(int position) { 
     assert !isEmpty() && (position >= 0) && position < length; 

     Node cNode = head; 

     for (int i = 0; i < position; i++) 
      cNode = cNode.next; 

     assert cNode != null; 
     return cNode; 
    } 


    public String toString(){ 
     String arrayString = "<"; 
     for(int i = 0; i < length; i++){ 
      String two = getNodeAt(i).toString(); 
      arrayString += two; 
      if(i <= (length - 2)){ 
       two = ", "; 
       arrayString += two; 
      } 

     } 
     arrayString += ">"; 

     return arrayString; 
    } 

    //TODO comment better 
    public class Node { 
     /** Reference to the data */ 
     public R data; 
     /** Reference to the next node is in the list */ 
     public Node next; 

     /** 
     * Sets the data for this node. 
     * @param data data to be carried by this node. 
     */ 
     public Node(R data) { 
      this.data = data; 
      this.next = null; 
     } 

     /** 
     * Sets the data for the node and assigns the next node in the list. 
     * @param data data to be carried by this node. 
     * @param nextNode next node in the list. 
     */ 
     public Node(R data, Node nextNode) { 
      this.data = data; 
      this.next = nextNode; 
     } 
     /** 
     * Returns just the data portion of the node. 
     * @return The data portion of the node. 
     */ 
     public R getData() { 
      return this.data; 
     } 
     /** 
     * Modified just the data portion of the node. 
     * @param data new data to be contained within the node. 
     */ 
     public void setData(R data) { 
      this.data = data; 
     } 

     /** 
     * What node does this node point to. 
     * @return the node that this node points to or null if it does not 
     * point anywhere. 
     */ 
     public Node getNextNode() { 
      return this.next; 
     } 

     /** 
     * Change the node that this node points to. 
     * @param nextNode a new node for this node to point to. 
     */ 
     public void setNextNode(Node nextNode) { 
      this.next = nextNode; 
     } 

     /** 
     * Display the state of just the data portion of the node. 
     */ 
     public String toString() { 
      return this.data.toString(); 
     } 
    } 



} 

這是主要的，多數民衆贊成殺死它

方法

private void testConstruction() { 
     System.out.println("\nTesting Constructor"); 
     System.out.print("----------------------------------------"); 
     System.out.println("----------------------------------------"); 

     Set151Interface s = makeSet(); 
     //added 
     s.add("Butterfinger"); 
     test(s.size() == 0, 

       "size() should return 0: " + s.size()); 
     test(s.toString().equals("<>"), 
       "toString returns \"<>\": " + s.toString()); 


     ArrayList<String> temp = new ArrayList<String>(); 
     temp.add("Butterfinger"); 
     temp.add("Milky Way"); 
     temp.add("Kit Kat"); 
     temp.add("Three Muskateers"); 

     Set151Interface s3 = makeSet(temp); 
      test(s3.size() == 4, 
       "size should return 4: " + s3.size()); 
     test(s3.toString().equals("<Butterfinger, Milky Way, Kit Kat, Three Muskateers>"), 
       "toString should return\n  "+ 
         "\"<Butterfinger, Milky Way, Kit Kat, Three Muskateers>\":\n  " 
         + s3.toString()); 

    } 

儘快得到補充butterfinger嘗試，我得到空指針異常指向此行 if (head.next == null) {

Answer 1

你剛剛宣佈private Node head;，它不接受任何值分配。所以編譯器拋出NPE

Answer 2

感謝您的幫助球員，我想通了:)。 第一天我編輯了我的驅動程序（並忘記了），一旦我複製驅動程序一切正常（迄今）再次感謝你們！