- 求单链表中有效节点的个数
//方法:获取到单链表的节点的个数(如果是带头节点的链表,需求不统计头节点) /** * * @param head 是链表的头节点 * @return 返回的是有效节点的个数 */ public static int getLength(HeroNode head) { if(head.next == null) { return 0; } int count = 0; //这里没有统计头节点 HeroNode cur = head.next; while(cur != null) { count++; cur = cur.next; } return count; }
- 查找单链表的倒数第k个节点
//查找单链表中倒数第K个节点 //思路:编写一个方法,接收head节点,同时接收一个 index(表示的是倒数第index个节点) //先把链表从头到尾遍历,得到链表的总长度length,我们重连表的的第一个开始遍历(length-index)个 public static HeroNode getLastKth(HeroNode head, int K) { if(head.next == null) { return null; } int length = getLength(head); if(K<=0 || K>length) { return null; } HeroNode tmp = head.next; int count = 0; while(true) { if(count == length-K) { break; } if(tmp != null) { count++; tmp = tmp.next; } } return tmp; }
- 单链表的反转
//将单链表进行反转 public static void reverseList(HeroNode head) { if(head.next == null || head.next.next == null) { return ; } //定义一个辅助节点,帮助遍历原来的链表 HeroNode current = head.next; HeroNode next = null; //指向当前节点[cur]的下一个节点 HeroNode reverseHead = new HeroNode(0, "", ""); //遍历原来的链表,每遍历一个节点,就将其取出,并放在新的链表reverseHead的最前端 while(current!=null) { next = current.next; //先暂时保存当前节点的下一个节点 current.next = reverseHead.next; reverseHead.next = current; current = next; } head.next = reverseHead.next; }
- 逆序打印单链表(方法一:先进行反转再打印,方法二:用一个辅助栈)
//逆序打印单链表 public static void reversePrint(HeroNode head) { if(head.next == null) { return; } Stack<HeroNode> stack = new Stack<HeroNode>(); HeroNode cur = head.next; while(cur!=null) { stack.push(cur); cur = cur.next; } //将栈的节点进行打印 while(stack.size()>0) { System.out.print(stack.pop()+" "); } }
- 合并两个有序单链表,合并后依然有序
//合并两个有序的单链表,合并后依然有序 public static void mergeList(SingleLinkedList list1, SingleLinkedList list2) { SingleLinkedList merge = new SingleLinkedList(); HeroNode node1 = list1.getHead().next; HeroNode node2 = list2.getHead().next; HeroNode cur = merge.getHead(); while(node1 != null && node2 != null) { if(node1.no <= node2.no) { cur.next = node1; node1 = node1.next; cur = cur.next; }else { cur.next = node2; node2 = node2.next; cur = cur.next; } } while(node1 != null) { cur.next = node1; node1 = node1.next; cur = cur.next; } while(node2 != null) { cur.next = node2; node2 = node2.next; cur = cur.next; } merge.showList(); }
- 全部过程
package com.linkedList; import java.util.Stack; public class SingleLinkedListDemo{ public static void main(String[] args) { //测试 //先创建节点 HeroNode node1 = new HeroNode(1, "宋江", "及时雨"); HeroNode node2 = new HeroNode(3, "卢俊义", "玉麒麟"); HeroNode node3 = new HeroNode(6, "吴用", "智多星"); HeroNode node4 = new HeroNode(8, "林冲", "豹子头"); HeroNode node5 = new HeroNode(2, "宋江", "及时雨"); HeroNode node6 = new HeroNode(3, "卢俊义", "玉麒麟"); HeroNode node7 = new HeroNode(5, "吴用", "智多星"); HeroNode node8 = new HeroNode(9, "林冲", "豹子头"); //创建一个链表 SingleLinkedList singleLinkedList = new SingleLinkedList(); //加入 singleLinkedList.add(node1); singleLinkedList.add(node2); singleLinkedList.add(node3); singleLinkedList.add(node4); singleLinkedList.showList(); System.out.println(); SingleLinkedList singleLinkedList1 = new SingleLinkedList(); singleLinkedList1.add(node5); singleLinkedList1.add(node6); singleLinkedList1.add(node7); singleLinkedList1.add(node8); singleLinkedList1.showList(); System.out.println(); mergeList(singleLinkedList, singleLinkedList1); //加入通过编号排序 // singleLinkedList.addByOrder(node4); // singleLinkedList.addByOrder(node1); // singleLinkedList.addByOrder(node2); // singleLinkedList.addByOrder(node3); // singleLinkedList.showList(); // HeroNode node = new HeroNode(2, "哈哈", "啊哈哈"); // singleLinkedList.updateNode(node); //显示 // singleLinkedList.showList(); // System.out.println(); // HeroNode head = singleLinkedList.getHead(); // System.out.println(getLength(head)); // HeroNode res = getLastKth(singleLinkedList.getHead(), 1); // System.out.println(res); // reverseList(singleLinkedList.getHead()); // reversePrint(singleLinkedList.getHead()); // singleLinkedList.showList(); } //查找单链表中倒数第K个节点 //思路:编写一个方法,接收head节点,同时接收一个 index(表示的是倒数第index个节点) //先把链表从头到尾遍历,得到链表的总长度length,我们重连表的的第一个开始遍历(length-index)个 public static HeroNode getLastKth(HeroNode head, int K) { if(head.next == null) { return null; } int length = getLength(head); if(K<=0 || K>length) { return null; } HeroNode tmp = head.next; int count = 0; while(true) { if(count == length-K) { break; } if(tmp != null) { count++; tmp = tmp.next; } } return tmp; } //方法:获取到单链表的节点的个数(如果是带头节点的链表,需求不统计头节点) /** * * @param head 是链表的头节点 * @return 返回的是有效节点的个数 */ public static int getLength(HeroNode head) { if(head.next == null) { return 0; } int count = 0; //这里没有统计头节点 HeroNode cur = head.next; while(cur != null) { count++; cur = cur.next; } return count; } //将单链表进行反转 public static void reverseList(HeroNode head) { if(head.next == null || head.next.next == null) { return ; } //定义一个辅助节点,帮助遍历原来的链表 HeroNode current = head.next; HeroNode next = null; //指向当前节点[cur]的下一个节点 HeroNode reverseHead = new HeroNode(0, "", ""); //遍历原来的链表,每遍历一个节点,就将其取出,并放在新的链表reverseHead的最前端 while(current!=null) { next = current.next; //先暂时保存当前节点的下一个节点 current.next = reverseHead.next; reverseHead.next = current; current = next; } head.next = reverseHead.next; } //合并两个有序的单链表,合并后依然有序 public static void mergeList(SingleLinkedList list1, SingleLinkedList list2) { SingleLinkedList merge = new SingleLinkedList(); HeroNode node1 = list1.getHead().next; HeroNode node2 = list2.getHead().next; HeroNode cur = merge.getHead(); while(node1 != null && node2 != null) { if(node1.no <= node2.no) { cur.next = node1; node1 = node1.next; cur = cur.next; }else { cur.next = node2; node2 = node2.next; cur = cur.next; } } while(node1 != null) { cur.next = node1; node1 = node1.next; cur = cur.next; } while(node2 != null) { cur.next = node2; node2 = node2.next; cur = cur.next; } merge.showList(); } //逆序打印单链表 public static void reversePrint(HeroNode head) { if(head.next == null) { return; } Stack<HeroNode> stack = new Stack<HeroNode>(); HeroNode cur = head.next; while(cur!=null) { stack.push(cur); cur = cur.next; } //将栈的节点进行打印 while(stack.size()>0) { System.out.print(stack.pop()+" "); } } } //定义SingleLinkedList 管理英雄人物 class SingleLinkedList{ //先初始化头节点,不存放具体数据 private HeroNode head = new HeroNode(0, "", ""); public HeroNode getHead() { return head; } //添加节点到单向链表 //当不考虑编号顺序时 //1.找到当前链表的最后节点 //2.将最后节点的next指向新的节点 public void add(HeroNode node) { //因为head节点不能动,所以需要一个辅助节点 HeroNode tmp = head; //遍历链表,找到最后 while(true) { //找到链表的最后 if(tmp.next == null) { break; } //如果没有找到最后,就将tmp后移 tmp = tmp.next; } //当退出while循环时,tmp指向了链表的最后 //将最后这个节点的next指向新的节点 tmp.next = node; } //第二种方式在添加英雄时,根据排名将英雄插入到指定位置 (如果有这个排名了,则提示失败) public void addByOrder(HeroNode node) { //因为头节点不能动,因此仍然通过一个辅助变量来找到添加的位置 //因为是单链表,需要找到添加位置的前一个节点 HeroNode tmp = head; boolean flag = false; //标识添加的编号是否存在 while(true) { if(tmp.next == null) { //说明tmp已经在链表最后 break; } if(tmp.next.no > node.no) { //位置找到,就在tmp的后面插入 break; }else if(tmp.next.no == node.no) { //说明编号已经存在 flag = true; break; } tmp = tmp.next; } //判断flag的值 if(flag) { System.out.println("不能添加,编号存在"); }else { node.next = tmp.next; tmp.next = node; } } //根据编号修改节点信息,根据node的编号即可 public void updateNode(HeroNode node) { //判断是否空 if(head.next == null) { System.out.println("链表为空"); return; } //找到需要修改的节点,根据no HeroNode tmp = head; boolean flag = false; while(true) { if(tmp == null) { break; //已经遍历完链表 } if(tmp.no == node.no) { flag = true; break; } tmp = tmp.next; } if(flag) { tmp.name = node.name; tmp.nickname = node.nickname; }else { System.out.println("没有找到"); } } //删除节点 //思路: //1.head 不能动,因此我们需要一个tmp辅助节点找到待删除节点的前一个节点 //2.说明比较的时候是比较tmp.next.no和需要删除的no比较 public void deleteNode(int no) { HeroNode tmp = head; boolean flag = false; while(true) { if(tmp.next == null) { break; } if(tmp.next.no == no) { flag = true; break; } tmp = tmp.next; } if(flag) { tmp.next = tmp.next.next; System.out.println("删除完毕"); }else { System.out.println("没有找到"); } } //显示链表[遍历] public void showList() { //判断链表是否为空 if(head.next == null) { System.out.println("链表为空"); return; } //因为头节点不能动,因此需要辅助变量来遍历 HeroNode tmp = head.next; while(true) { //判断是否到链表最后 if(tmp == null) { break; } //输出节点信息 System.out.println(tmp.toString()); //将tmp后移 tmp = tmp.next; } } } //定义HeroNode , 每个HeroNode对象就是一个节点 class HeroNode{ public int no; public String name; public String nickname; public HeroNode next; //指向下一个节点 public HeroNode(int no, String name, String nickname){ this.no = no; this.name = name; this.nickname = nickname; } //显示方便重写toString() @Override public String toString() { return "HeroNode [no=" + no + ", name=" + name + ", nickname=" + nickname + "]"; } }