单链表添加方法

Question

嘿家伙我试图实现单链表的appeed方法时遇到了问题。 这里是代码：

public void append (int item) { 
//inserts item to the end of the list 
     if (head == null){ 
      head = new LinkInt(); 
      curr = head; 
      curr.elem = item; 
     } 
     else{ 
     LinkInt temp = head; 
     while (temp.next != null){ 
     temp = temp.next;} 
     temp.elem = item; 
     } 


} 

，这里是我的打印方法（不知道其正确的为好）：

public void print() { 
//outprint the array 
    //ie. <1, 2, |3, 4> 
    if ( head == null) { 
     System.out.print("<"); 
     System.out.print(">"); 
    } 
    else{ 
    LinkInt temp = head; 
    System.out.print("<"); 
    while (temp != null) { 
     if (temp == curr){ 
       System.out.print("|" + temp.elem + ","); } 
     else{ 
     System.out.print(temp.elem); 
     System.out.print(",");} 
     temp = temp.next; 
    } 
    System.out.print(">"); 
    } 
} 

}

继承人的问题：

让利说上面3 - >>>我得到< | 3> ，但如果我做了后 - 5 >>>>我得到< | 5>删除我的第一个项目。

帮我个忙，请:(

Answer 1

LinkInt temp = head; 
while (temp.next != null){ 
    temp = temp.next; 
} 
temp.elem = item; 

这样做是什么 - temp.next is null时3已经插入。因此，它会转到temp.elem = item并覆盖您的现有值。做这样的事情： -

LinkInt temp = head; 
while (temp.next != null){ 
    temp = temp.next; 
} 
//temp.elem = item; -Not needed. 

temp1= new LinkInt(); 
temp1.elem = item; 
temp1.next = null; 
temp.next = temp1; 

Answer 2

这些语句后：

while (temp.next != null) 
{ 
    temp = temp.next; 
} 

做这样的：

tmp1= new LinkInt(); 
tmp1.elem = item; 
tmp1.next = null 

tmp.next = tmp1 

，而不是这样的：

temp.elem = item; 

尝试一下本作打印方法：

public void print() 
{ 
    //outprint the array 
    //ie. <1, 2, |3, 4> 
    if ( head == null) 
    { 
     System.out.print("<"); 
     System.out.print(">"); 
    } 
    else 
    { 
     LinkInt temp = head; 
     System.out.print("<"); 
     while (temp->next != null) 
     { 
      System.out.print("|" + temp.elem + ","); 
      temp = temp.next; 
     } 
     System.out.print("|" + temp.elem);} 
     System.out.print(">"); 
    } 

} 

Answer 3

有法这样

public void append(int item) 
{ 
    LinkInt l = new LinkInt(); 
    l.elem = item; 
    if (head == null) 
     head = l; 
    else { 
     LinkInt tmp = head; 
     while (tmp.next != null) 
      tmp = tmp.next; 
     tmp.next = l; 
}