标签:Node head 两个 序列表 合并 next curB curA null
public class Code07 {
public static class Node<V> {
public V value;
public Node<V> last;
public Node<V> next;
public Node() {
}
public Node(V v) {
value = v;
last = null;
next = null;
}
}
public static void print(Node head){
while (head != null){
System.out.print(head.value+" ");
head = head.next;
}
}
public static void main(String[] args) {
Node node1 = new Node(1);
Node node2 = new Node(8);
Node node3 = new Node(11);
Node node4 = new Node(14);
Node node5 = new Node(1);
Node node6 = new Node(16);
Node node7 = new Node(19);
node1.next=node2;
node2.next=node3;
node3.next = node4;
node5.next = node6;
node6.next = node7;
Node ret = mergeLinkList(node1,node5);
print(ret);
}
/**
* 精髓就是谁大谁不动
* @param node1
* @param node2
* @return
*/
private static Node mergeLinkList(Node node1, Node node2) {
if(node1 == null) {
return node2;
}
if(node2 == null) {
return node1;
}
Node<Integer> head = null;
Node<Integer> curA = node1;
Node<Integer> curB = node2;
if(curA.value<=curB.value){
head = curA;
}else{
head = curB;
}
Node curMin = null;
while (true){
if (curA.value<=curB.value){
curMin = curA;
curA = curA.next;
curMin.next =curA;
} else {
curMin = curB;
curB = curB.next;
}
if(curA == null && curB == null){
return head;
} else if (curA == null && curB != null){
curMin.next = curB;
return head;
}else if (curB == null && curA != null){
curMin.next = curA;
return head;
}
}
}
private static int length(Node node){
int length = 0;
while (node != null){
length++;
node = node.next;
}
return length;
}
}
标签:Node,head,两个,序列表,合并,next,curB,curA,null 来源: https://blog.csdn.net/qq_22717543/article/details/121187742
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。