使用JAVA做可爱得小单向链表，通过上线去找下线，上线莫名死了就完了，下线失联了，对下线得操作都要通过上线
1.使用类创造一个节点
2.建立一个头节点，头节点得地址就是整个链表得地址
JAVA中一个基本的链表节点就是这样的
public class HeroNode {
public int age;
public String name;
public String nickName;
public HeroNode next;
@Override
public String toString() {
return "HeroNode{" +
"age=" + age +
", name='" + name + '\'' +
", nickName='" + nickName + '\'' +
'}';
}
public HeroNode(){
}
public HeroNode(int age, String name, String nickName){
this.age = age;
this.name = name;
this.nickName = nickName;
}
}
链表的内容和操作
public class SingleLInkedList {
private HeroNode headNode = new HeroNode();
public HeroNode getHeadNode() {
return headNode;
}
public void delete(int age){
HeroNode temp = headNode;
boolean flag = false;
while(true){
if(temp.next == null){
break;
}
if(temp.next.age == age){
flag = true;
break;
}
temp = temp.next;
}
if(flag){
temp.next = temp.next.next;
}
else
System.out.println("我们没找到");
}
public void add(HeroNode heroNode){
HeroNode temp = headNode;
while(true){
if(temp.next == null ){
break;
}
else
temp = temp.next;
}
temp.next = heroNode;
}
public void show(){
if(headNode == null){
System.out.println("链表为空你个傻逼");
}
else{
HeroNode temp = headNode.next;
while(temp != null){
System.out.println(temp);
temp = temp.next;
}
}
}
public void insert(HeroNode heroNode){
HeroNode temp = headNode;
while(true){
if(temp.next == null){
break;
}
if (temp.next.age > heroNode.age){
break;
}
else if(temp.next.age == heroNode.age){
System.out.println("你插入重复了");
break;
}
temp = temp.next;
}
heroNode.next = temp.next;
temp.next = heroNode;
}
public void update(HeroNode newHeroNode){
if(headNode.next == null){
System.out.println("链表为空");
return;
}
HeroNode temp = headNode;
boolean flag = false;
while(true){
if(temp == null){
break;
}
if (newHeroNode.age == newHeroNode.age){
flag = true;
break;
}
}
if(flag){
temp.name = newHeroNode.name;
temp.nickName = newHeroNode.nickName;
}
else
System.out.println("没有找到这个编号，你是不是傻了");
}
}
面试题目
public class TencentGroup {
public static int length(HeroNode headNode){
if(headNode.next == null){
System.out.println("这是空的单链表");
return 0;
}
int length = 0;
HeroNode temp = headNode.next;
while(true){
if(temp == null){
break;
}
else{
length ++;
}
temp = temp.next;
}
return length;
}
public static HeroNode findKNode(int index,HeroNode headNode){
if (headNode.next == null){
return null;
}
int length = TencentGroup.length(headNode);
if(index <= 0 || index > length){
System.out.println("目录有问题");
}
HeroNode temp = headNode.next;
for (int i = 1; i <= length - index;i++ ){
if(temp == null){
break;
}
temp = temp.next;
}
return temp;
}
}
如图所示
单链表只能从上线找下线，下线没办法找上线
因此，遍历链表，采用头插法，将链表颠倒后放在新的头结点上
public HeroNode reversetList(HeroNode headNode){
System.out.println("传进来的地址是" + headNode);
if(headNode.next == null){
System.out.println("你个傻逼，没有");
}
else{
HeroNode temp = headNode.next;
HeroNode cur = null;
do{
cur = temp.next;
temp.next = newHeadNode.next;
newHeadNode.next = temp;
temp = cur;
}
while(temp != null);
headNode.next = null;
}
System.out.println("新头地址是" + newHeadNode);
return newHeadNode;
}
*我自己写的！有头节点尾节点！*没有头尾节点我要吐了
JAVA中没有指针的概念，只有引用数据类型，所以我们使用一个节点，充当指针得作用，毕竟new出来的都在堆里，你的节点名字也只是指向它而已
自己创造的链表节点部分：
1.注意让创造出来的指针域默认为Null比较方便操作
package linkedList;
public class Node {
public int age;
public String name;
public String nickName;
public Node nextNode = null;
public Node(int age, String name, String nickName, Node nextNode) {
this.age = age;
this.name = name;
this.nickName = nickName;
this.nextNode = nextNode;
}
public Node() {
}
@Override
public String toString() {
return "Node{" +
"age=" + age +
", name='" + name + '\'' +
", nickName='" + nickName + '\'' +
'}';
}
}
代码主题部分，增加了头节点和尾节点，方便操作：
1.尾插法，在尾指针后面插入数据
使用尾巴指针插入新的节点，并且让尾指针指向最后一个节点
public void add(int age,String name,String nickName) {
headNode.age++;
Node newNode = new Node();
newNode.age = age;
newNode.name = name;
newNode.nickName = nickName;
tailPoint.nextNode = newNode;
tailPoint = newNode;
tailPoint.nextNode = null;
}
2.打印整个链表
- 一个临时指针从头开始
- 打印一个移动一次
- 直到打印到链表尾部
public void show(){
if(headNode.nextNode == null){
System.out.println("链表为空");
}
else{
Node temp = headPoint.nextNode;
while(temp != null){
System.out.println(temp);
temp = temp.nextNode;
}
}
}
整个链表代码
真的难点在于链表删除的位置：
1.遍历到链表的要删除节点的前一个节点位置
2.完成上下连接
3.注意判断条件是temp.next.age == 条件，用前面一个节点，表示下一个节点
4.注意temp要从head开始，不然首节点判断不到
5.结束时候temp不要到最后一个节点才结束，因为尾巴指针已经被判断过了，
6.尾巴指针对应的节点很可能一开始就被删除了，注意
7.删除一个节点很容易，这个节点将下面交给上级就行了
package linkedList;
import com.sun.corba.se.impl.orb.ParserTable;
import java.sql.SQLOutput;
public class LinkedList {
private Node headNode = new Node();
private Node headPoint = headNode;
private Node tailPoint = headPoint;
public LinkedList() {
this.headNode.age = 0;
}
public int size(){
return this.headNode.age;
}
public Node getHeadNode() {
return headNode;
}
public void add(int age,String name,String nickName) {
headNode.age++;
Node newNode = new Node();
newNode.age = age;
newNode.name = name;
newNode.nickName = nickName;
tailPoint.nextNode = newNode;
tailPoint = newNode;
tailPoint.nextNode = null;
}
public void show(){
if(headNode.nextNode == null){
System.out.println("链表为空");
}
else{
Node temp = headPoint.nextNode;
while(temp != null){
System.out.println(temp);
temp = temp.nextNode;
}
}
}
public void deleteAll(int number){
Node temp = headPoint;
boolean flag = false;
if(headNode.nextNode == null){
System.out.println("链表为空");
}
else {
while (temp.nextNode != null){
if(temp.nextNode.age == number){
this.headNode.age --;
flag = true;
temp.nextNode = temp.nextNode.nextNode;
}
temp = temp.nextNode;
if(temp == null){
break;
}
}
if(flag == false){
System.out.println("不存在这样的节点");
}
if(headNode.age == 0){
tailPoint = null;
}
}
}
public void delete(int number){
if(headNode.nextNode == null){
System.out.println("链表是空的");
}
else{
Node temp = headPoint;
boolean flag = false;
while (true){
if(temp.nextNode == null){
break;
}
if(temp.nextNode.age == number){
headNode.age = headNode.age - 1;
flag = true;
temp.nextNode = temp.nextNode.nextNode;
break;
}
temp = temp.nextNode;
}
if(flag == true){
System.out.println("我们成功删除了链表");
}
else{
System.out.println("链表中不包含这个节点");
}
}
if(this.headNode.age == 0 ){
tailPoint = headPoint;
}
}
public void insert(int pos,Node newNode){
Node temp = new Node();
temp = headPoint.nextNode;
boolean flag = false;
while(true){
if(temp.age == pos){
headNode.age = headNode.age + 1;
flag = true;
newNode.nextNode = temp.nextNode;
temp.nextNode = newNode;
break;
}
temp = temp.nextNode;
if(temp == null){
break;
}
}
if(flag == false){
System.out.println("没有插入位置");
}
}
}
