java 数据结构next函数_编程数据结构中的链表代码(java)

publicclassLinkCharNode{privatechardata='\0';privateLinkCharNodenext=null;publicvoidsetData(chardata){this.data=data;}publicvoidsetNext(LinkCharNodenext){this.next=next;}...

public class LinkCharNode {private char data='\0';private LinkCharNode next = null;public void setData(char data){this.data=data;}public void setNext(LinkCharNode next){this.next=next;}public char getData(){return(this.data);}public LinkCharNode getNext(){return(this.next);}}public class LinkCharTable {private LinkCharNode head=null;private int counts=0;public LinkCharNode getHead(){return head;}public void insert(char d){if(head==null){ head=new LinkCharNode();}LinkCharNode n = new LinkCharNode();n.setData(d);if(head.getNext()==null){head.setNext(n);}else{n.setNext(head.getNext());head.setNext(n);}counts++;}public void delete(char d ){if(head==null){System.out.println("链表中无数据！");return;}LinkCharNode p =head;LinkCharNode n =head.getNext();while(n!=null){if(n.getData()==d){p.setNext(n.getNext());}p=n;n=n.getNext();}}public void print(){LinkCharNode n =head.getNext();int iCounter=1;while(n!=null){System.out.print(n.getData()+" ");n=n.getNext();iCounter++;}System.out.println();}public int size(){return this.counts;}}求高手帮忙注释下这段代码 (主要是delete 和insert两个函数所写的看不懂)其余的也都注释一下这段代码的最后一段是这样的public class Combinate {public Combinate(){}/*** @param args*/public static void main(String[] args) {// TODO Auto-generated method stubLinkCharTable i=new LinkCharTable();i.insert('Y');i.insert('D');i.insert('U');i.insert('T');i.insert('S');i.print();reverse(i);i.print();}public static void reverse(LinkCharTable lct){LinkCharNode n=lct.getHead().getNext();while(n!=null){char ch=n.getData();lct.delete(ch);lct.insert(ch);n=n.getNext();}}}这个本人都看得懂 就是前面的两个类 求 高手好好的 解释一下 谢谢啦(细节方面尽量也详细点)谢谢啦！！！

展开