单链表相关操作
- 单链表的创建、添加、修改、删除
- 常见面试题:
1)求单链表中有效结点个数
2)查找单链表中的倒数第k个结点
3)单链表的反转
4)从尾到头打印单链表
5)合并两个有序链表
package com.atguigu.demomptest.linkedlist;
import java.util.Date;
import java.util.Stack;
import static com.atguigu.demomptest.linkedlist.SingleLinkedList.*;
public class SingleLinkedListDemo {
public static void main(String[] args) {
HeroNode hero1 = new HeroNode(1, "宋江", "及时雨");
HeroNode hero2 = new HeroNode(2, "卢俊义", "玉麒麟");
HeroNode hero3 = new HeroNode(3, "吴用", "智多星");
HeroNode hero4 = new HeroNode(4, "林冲", "豹子头");
HeroNode hero5 = new HeroNode(5, "a", "aa");
HeroNode hero6 = new HeroNode(6, "b", "bb");
HeroNode hero7 = new HeroNode(7, "c", "cc");
HeroNode hero8 = new HeroNode(8, "d", "dd");
/*
singleLinkedList.list();
HeroNode heroNode = new HeroNode(2, "小卢", "玉麒麟~~");
singleLinkedList.update(heroNode);
System.out.println("修改后的链表情况~");
singleLinkedList.list();*
System.out.println("有效结点个数=" + getLength(singleLinkedList.getHead()));
HeroNode res = findLastIndexNode(singleLinkedList.getHead(), 1);
System.out.println("res=" + res);
System.out.println("反转前的链表==============");
singleLinkedList.list();
reverseList(singleLinkedList.getHead());
System.out.println("反转后链表===================");
singleLinkedList.list();
System.out.println("==========逆序打印单链表,链表结构不变==============");
reversePrint(singleLinkedList.getHead());*/
SingleLinkedList s1 = new SingleLinkedList();
s1.addByOrder(hero1);
s1.addByOrder(hero3);
s1.addByOrder(hero5);
s1.addByOrder(hero8);
SingleLinkedList s2 = new SingleLinkedList();
System.out.println("链表的头是否相等"+(s1.getHead()==s2.getHead()));
s2.addByOrder(hero2);
s2.addByOrder(new HeroNode(5,"aaa","aaaaa"));
s2.addByOrder(hero7);
System.out.println("h1:");
s1.list();
System.out.println("h2:");
s2.list();
mergeList1(s1.getHead(),s2.getHead());
System.out.println("合并后的链表:::");
s1.list();
}
}
class SingleLinkedList {
private HeroNode head = new HeroNode(0, "", "");
public HeroNode getHead() {
return head;
}
public void add(HeroNode heroNode) {
HeroNode temp = head;
while (true) {
if (temp.next == null) {
break;
}
temp = temp.next;
}
temp.next = heroNode;
}
public void addByOrder(HeroNode heroNode) {
HeroNode temp = head;
boolean flag = false;
while (true) {
if (temp.next == null) {
break;
}
if (temp.next.no > heroNode.no) {
break;
} else if (temp.next.no == heroNode.no) {
flag = true;
break;
}
temp = temp.next;
}
if (flag) {
System.out.printf("准备插入的英雄的编号 %d 已经存在,不能加入\n", heroNode.no);
} else {
heroNode.next = temp.next;
temp.next = heroNode;
}
}
public void update(HeroNode newHeroNode) {
if (head.next == null) {
System.out.println("链表为空");
return;
}
HeroNode temp = head;
boolean flag = false;
while (true) {
if (temp.next == null) {
System.out.println("遍历完链表还没找到");
break;
}
if (temp.next.no == newHeroNode.no) {
flag = true;
break;
}
temp = temp.next;
}
if (flag) {
temp.next.name = newHeroNode.name;
temp.next.nickname = newHeroNode.nickname;
} else {
System.out.printf("不存在编号为 %d 的英雄,不能修改", newHeroNode.no);
}
}
public void delete(int no) {
HeroNode temp = head;
boolean flag = false;
while (true) {
if (temp.next == null) {
System.out.println("链表遍历结束");
break;
}
if (temp.next.no == no) {
flag = true;
break;
}
temp = temp.next;
}
if (flag) {
temp.next = temp.next.next;
} else {
System.out.printf("没有找到要编号为 %d 的英雄,删除失败", no);
}
}
public static int getLength(HeroNode head) {
HeroNode curr = head.next;
int length = 0;
while (curr != null) {
length++;
curr = curr.next;
}
return length;
}
public static HeroNode findLastIndexNode(HeroNode head, int index) {
if (head.next == null) {
return null;
}
int size = getLength(head);
if (index <= 0 || index > size) {
return null;
}
HeroNode temp = head.next;
for (int i = 0; i < size - index; i++) {
temp = temp.next;
}
return temp;
}
public static void reverseList(HeroNode head) {
if (head.next == null || head.next.next == null) {
return;
}
HeroNode reverseHead = new HeroNode(0, "", "");
HeroNode cur = head.next;
HeroNode next = null;
while (cur != null) {
next = cur.next;
cur.next = reverseHead.next;
reverseHead.next = cur;
cur = next;
}
head.next = reverseHead.next;
}
public static void reversePrint(HeroNode head) {
if (head.next == null) {
return;
}
Stack<HeroNode> stack = new Stack<>();
HeroNode cur = head.next;
while (cur != null) {
stack.push(cur);
cur = cur.next;
}
while (stack.size()>0){
System.out.println(stack.pop());
}
}
public static void mergeList(HeroNode h1,HeroNode h2){
System.out.println("进入了merge方法。h1.next="+h1.next);
HeroNode cur1 = h1.next;
HeroNode cur2 = h2.next;
HeroNode next1=null;
HeroNode next2=null;
HeroNode mergeHead = new HeroNode(0,"","");
HeroNode temp = mergeHead;
System.out.println("cur1==null:::"+cur1==null);
System.out.println("cur2==null:::"+cur2==null);
while(true){
if (cur1==null){
temp.next=cur2;
System.out.println("第一个单链表遍历完了,cur2:"+cur2+",cur2.next:"+cur2.next);
break;
}
if (cur2==null){
temp.next=cur1;
System.out.println("第二个单链表遍历完了");
break;
}
if (cur1.no<cur2.no){
next1 = cur1.next;
cur1.next=null;
temp.next=cur1;
temp = temp.next;
cur1=next1;
System.out.println("h1::"+mergeHead.next);
}else{
next2 = cur2.next;
cur2.next=null;
temp.next=cur2;
temp = temp.next;
cur2=next2;
System.out.println("h2:::"+mergeHead.next);
}
}
h1.next=mergeHead.next;
}
public static HeroNode mergeList1(HeroNode h1,HeroNode h2){
if (h1==null){
return h2;
}else if (h2==null){
return h1;
}else if (h1.no<h2.no){
h1.next=mergeList1(h1.next,h2);
return h1;
}else {
h2.next = mergeList1(h1,h2.next);
return h2;
}
}
public void list() {
if (head.next == null) {
System.out.println("链表为空");
return;
}
HeroNode temp = head.next;
while (true) {
if (temp == null) {
break;
}
System.out.println(temp);
temp = temp.next;
}
}
}
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;
}
@Override
public String toString() {
return "HeroNode{" +
"no=" + no +
", name='" + name + '\'' +
", nickname='" + nickname + '\'' +
'}';
}
}