时间:2021-05-20
本文实例为大家分享了Java 8实现任意参数的单链表,供大家参考,具体内容如下
1、实现功能
1)add():链表末尾添加元素;
2)pop():移除链表尾部元素;
3)insert():指定索引处添加元素;
4)delete():指定索引处删除元素;
5)getSize():获取链表当前长度;
6)display():展示链表当前元素。
2、代码
package DataStructure;/** * @author: Inki * @email: inki.yinji@qq.com * @create: 2020 1024 * @last_modify: 2020 1025 */public class MySingleLinkedList <AnyType> { /** * Only used to store the head node. */ private SingleNode<AnyType> head = new SingleNode(new Object()); /** * The single linked list current size. */ private int size = 0; /** * Add element to the end of the list. * @param: * paraVal: The given value. */ public void add(AnyType paraVal) { insert(size, paraVal); }//Of add /** * Pop the last element. * @return: * The popped value. */ public AnyType pop(){ return delete(size - 1); }//Of pop /** * Insert element at specified index. * @param: * paraIdx: The given index. * paraVal: The given value. */ public void insert(int paraIdx, AnyType paraVal) { if (paraIdx > size) { throw new IndexOutOfBoundsException("The index error."); }//Of if SingleNode <AnyType> tempNode = head; int i = 0; while (i++ < paraIdx) { tempNode = tempNode.next; }//Of while SingleNode<AnyType> paraNode = new SingleNode <>(paraVal); paraNode.next = tempNode.next; tempNode.next = paraNode; size++; }//of add /** * Delete the element at specified index. * @param: * paraIdx: The given index of element to delete. * @return: * The deleted value. */ public AnyType delete(int paraIdx) { if (size == 0) { throw new RuntimeException("The single linked list is empty."); }//Of if if (size <= paraIdx) { throw new IndexOutOfBoundsException("The index error."); }//Of if SingleNode <AnyType> retNode = head; int i = 0; while (i++ < paraIdx) { retNode = retNode.next; }//Of while retNode.next = retNode.next.next; size--; return retNode.val; }//Of delete /** * Get the current size of the single linked list. * @return: * The current size of the single linked list. */ public int getSize() { return size; }//Of getSize /** * Display the single linked list. */ public void display() { if (size == 0) { throw new RuntimeException("The single linked list is empty."); }//Of if System.out.print("The single linked list is:\n["); SingleNode <AnyType> tempNode = head; int i = 0; while (i++ < size - 1) { tempNode = tempNode.next; System.out.printf("%s, ", tempNode.val); }//Of while System.out.printf("%s]\n", tempNode.next.val); }//Of display /** * The main function. */ public static void main(String[] args) { MySingleLinkedList <Character> test = new MySingleLinkedList<>(); test.add('a'); test.add('b'); test.insert(0, 'c'); test.add('d'); test.insert(0, '5'); test.delete(4); test.pop(); test.add('+'); test.display(); System.out.println(test.getSize()); }//Of main}//Of class MySingleLinkedListclass SingleNode <AnyType>{ /** * The value. */ AnyType val; /** * The next node. */ SingleNode<AnyType> next; /** * The first constructor. * @param * paraVal: The given value. */ SingleNode (AnyType paraVal) { val = paraVal; }//The first constructor}//Of class SingleNode以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持。
声明:本页内容来源网络,仅供用户参考;我单位不保证亦不表示资料全面及准确无误,也不保证亦不表示这些资料为最新信息,如因任何原因,本网内容或者用户因倚赖本网内容造成任何损失或损害,我单位将不会负任何法律责任。如涉及版权问题,请提交至online#300.cn邮箱联系删除。
本文实例为大家分享了Java8实现任意参数的链栈,供大家参考,具体内容如下1、实现功能1)push():入栈;2)pop():出栈;3)getSize():获取
本文实例为大家分享了java实现单链表、双向链表的相关代码,供大家参考,具体内容如下java实现单链表:packagecode;classNode{Nodene
java数据结构单链表的实现单链表实现链表的打印及元素删除操作,链表的实现主要是next属性的定义,将一堆节点关联起来的。实现简单的链表如下:publiccla
Java实现单链表反转,递归和非递归两种形式/***反转单链表*//***定义链表**@author16026**/classNode{intval;Noden
java实现单链表逆转详解实例代码:classNode{Nodenext;Stringname;publicNode(Stringname){this.name