单链表的学习

链表合并笔记

完整代码如下

public class LinkedTest {
	public static void main(String[] args) {
		
		System.out.println("合并前-------------");
		
		//创建一个链表对象，添加链表节点
		SingleMergeLinked sml_one = new SingleMergeLinked();
		
		LinkNode lOne = new LinkNode(1);
		LinkNode lTwo = new LinkNode(3);
		LinkNode lThree = new LinkNode(5);
		LinkNode lFrou = new LinkNode(7);
		
		sml_one.add(lOne);
		sml_one.add(lTwo);
		sml_one.add(lThree);
		sml_one.add(lFrou);
		
		sml_one.sList();
		
		
		SingleMergeLinked sml_two = new SingleMergeLinked();
		
		LinkNode nOne = new LinkNode(2);
		LinkNode nTwo = new LinkNode(4);
		LinkNode nThree = new LinkNode(6);
		LinkNode nFrou = new LinkNode(8);
		
		sml_two.add(nOne);
		sml_two.add(nTwo);
		sml_two.add(nThree);
		sml_two.add(nFrou);
		
		sml_two.sList();
		
		System.out.println("合并后-------------");
		
		SingleMergeLinked mergeAfter = new SingleMergeLinked();
		mergeAfter.add(mergeAfter.mergeLink(sml_one, sml_two)); 
		mergeAfter.sList();
	}

}

//链表对象
class SingleMergeLinked{

	//定义链表头部	
	private LinkNode head = new LinkNode(0);
	
	
	
	public LinkNode getHead() {
		return head;
	}


	public void add(LinkNode linkNode) {
		LinkNode node = head;
		
		while(true) {
			if(node.next == null) {
				break;
			}
			node = node.next;
		}
		
		node.next = linkNode;
	}
	
	public LinkNode mergeLink(SingleMergeLinked one,SingleMergeLinked two) {
		LinkNode sOne = one.getHead().next;
		LinkNode sTwo = two.getHead().next;
		
		if(sOne.next == null) {
			return sTwo;
		}
		if(sTwo.next == null) {
			return sOne;
		}
		
		
		LinkNode temp = new LinkNode(0);
		LinkNode flag = temp;
		
		while(sOne != null && sTwo != null) {
			
			int oneVal = sOne.value;
			int twoVal = sTwo.value;
			
			if(oneVal < twoVal) {
				flag.next = new LinkNode(oneVal);
				sOne = sOne.next;
			}else {
				flag.next = new LinkNode(twoVal);
				sTwo = sTwo.next;
			}
			
			flag = flag.next;
			
		}
		
		
		if(sOne != null) {
			flag.next = sOne;
		}
		if(sTwo != null) {
			flag.next = sTwo;
		}
		
		return temp.next;
	}
	
	//遍历链表
	public void sList() {
		if(head.next == null) {
			System.out.println("链表为空");
			return;
		}
		LinkNode temp = head.next;
		while(true) {
			if(temp == null){
				break;
			}
			System.out.println(temp);
			temp = temp.next;
		}
	}
}

//节点对象
class LinkNode{
	public int value;
	public LinkNode next;
	
	public LinkNode() {
		
	}
	
	public LinkNode(int value) {
			this.value = value;
	}

	@Override
	public String toString() {
		return "LinkNode [value=" + value + "]";
	}
	

部分代码

1. 添加节点

public void add(LinkNode linkNode) {
		//可以看做一个傀儡节点，用来代替头部节点
		LinkNode node = head;
		
		while(true) {
			//找到链表的最尾端节点
			if(node.next == null) {
				break;
			}
			//不断移动节点位置
			node = node.next;
		}
		//将新的节点加入到最尾端的节点后面
		node.next = linkNode;
	}

2. 遍历链表节点

public void sList() {
		//先判断是否是空表
		if(head.next == null) {
			System.out.println("链表为空");
			return;
		}
		//还是定义一个傀儡节点
		//因为主要是遍历整个链表的信息，因此将头部省略
		LinkNode temp = head.next;
		while(true) {
			//判断链表是否已经遍历完成
			if(temp == null){
				break;
			}
			//打印节点信息
			System.out.println(temp);
			temp = temp.next;
		}
	}

3. 链表合并操作

public LinkNode mergeLink(SingleMergeLinked one,SingleMergeLinked two) {
		//定义傀儡节点，取出链表中除了头结点之外的节点
		LinkNode sOne = one.getHead().next;
		LinkNode sTwo = two.getHead().next;
		
		//判断其中的链表是否是空
		if(sOne.next == null) {
			return sTwo;
		}
		if(sTwo.next == null) {
			return sOne;
		}
		
		//定义新的节点头
		LinkNode temp = new LinkNode(0);
		
		//傀儡节点，替代头结点
		LinkNode flag = temp;
		
		//进行两个链表中的值的循环比较
		while(sOne != null && sTwo != null) {
			
			int oneVal = sOne.value;
			int twoVal = sTwo.value;
			
			//如果其中一个链表的值被加入新节点中，进行节点的后移操作
			if(oneVal < twoVal) {
				flag.next = new LinkNode(oneVal);
				sOne = sOne.next;
			}else {
				flag.next = new LinkNode(twoVal);
				sTwo = sTwo.next;
			}
			
			//将傀儡节点向后移动
			flag = flag.next;
		}
		
		//循环换成之后，在判断是否已经把所有节点都处理完
		//如果还有则直接加入到新的链表尾部
		if(sOne != null) {
			flag.next = sOne;
		}
		if(sTwo != null) {
			flag.next = sTwo;
		}
		
		//将除了头结点之外的节点返回
		return temp.next;
	}

4. 主方法主要代码段

		//创建新的链表对象
		SingleMergeLinked mergeAfter = new SingleMergeLinked();
		
		//将合并后的链表节点添加对象之中
		mergeAfter.add(mergeAfter.mergeLink(sml_one, sml_two)); 

		//最后进行遍历查看
		mergeAfter.sList();