六月二十七的博客

//两个单链表生成相加链表//利用栈结构public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public Node addList(Node head1,Node head2){ Stack&...

//删除链表a/b处的节点public Node removeByBatio(Node head,int a,int b){ if(a<1||a>b){ return head; } int len=0; Node cur=head; while(cur!=null){ len++ cur=cu...

//返回链表第一个进入环的节点public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public Node getLoopNode(Node head){ if(head==null||head....

//返回两个无环链表的相交节点public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public Node getIntersectNode(Node head1,Node head2){ if(...

//返回两个链表的第一个公共节点public Node FindFirstCommonNode(Node head1, Node head2) { Node p1 = head1; Node p2 = head2; while (p1 != p2){ p1 = (p1 != null ? p1.next : head2); p2 = (p...

//将搜索二叉树转换成双向链表//利用队列public class Node{ public int value; public Node left; public Node right; public Node(int data){ this.value=data; }}public Node searchBinaryTreeCo...

//单链表的选择排序public static Node selectSort(Node head){ Node tail=null;//排序部分尾部 Node cur=head;//未排序部分头部 Node smallPre=null;//最小节点的前一个节点 Node small=null;//最小的节点 while(cur!=null){ ...

//复制含有随机指针节点的链表public Node copyLinkedListWithRand(Node head){ if(head==null){ return null; } Node cur=head; Node next=null; //复制并链接每一个节点 while(cur!=null){ nex...

//单链表的选择排序public static Node selectSort(Node head){ Node tail=null;//排序部分尾部 Node cur=head;//未排序部分头部 Node smallPre=null;//最小节点的前一个节点 Node small=null;//最小的节点 while(cur!=null){ ...

//返回链表长度public int length(){ int len=0; Node tmp=head; while(tmp!=null){ len++; tmp=tmp.next; } return len;}

//在链表尾部加入新节点public class Node{ public int data; public Node next; public Node(int data){ this.data=data; }}public void addNode(int n){ Node newNode=new Node(n); if(...

//检查链表长度是奇数还是偶数public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public void isLinkedListLengthEven(Node head){ while(hea...

//求链表环的长度public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public int findLoopLength(Node head){ Node fast=head; Node...

//逐对逆序链表public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}//递归实现public Node reversePairRecursive(Node head){ Node tmp; ...

//将单链表的每k个节点之间逆序//利用栈结构public Node reverseKNode(Node head,int k){ if(k<2){ return head; } Stack<Node> stack=new Stack<Node>(); Node newHead=head; Node cur...

//删除链表的中间节点public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public Node removeMidNode(Node head){ if(head==null||head.ne...

//反转部分单向链表public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public Node reversePartLinkedList(Node head,int from,int to){ ...

//反转单向链表public void ReverseLinkedList(Node head){ Node pre=null; Node next=null; while(head!=null){ next=head.next; head.next=pre; pre=head; head=next; ...

//寻找单链表的中间结点//思路：定义快指针fast，慢指针slowpublic Node searchMediumNode(Node head){ Node fast=head; Node slow=head; while(fast!=null&&fast.next!=null&&fast.next.next!=null){ ...

//从链表中删除重复的数据//1.使用Hashtablepublic void deleteDuplecateData(Node head){ Hashtable<Integer,Integer> table=new Hashtable<Integer,Integer>(); Node tmp=head; Node pre=null; ...

//在单链表中删除指定值的节点//1.利用栈public Node removeValue(Node head,int num){ Stack<Node> stack=new Stack<Node>(); while(head!=null){ if(head.value!=num){ stack.push(hea...

//向有序环形单链表中插入节点public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public Node insertNum(Node head,int num){ Node node=new ...

//合并两个有序单链表public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public Node mergeLinkedList(Node head1,Node head2){ if(head1...

//在双链表删除倒数第k个节点public class DoubleNode{ public int value; public DoubleNode last; public DoubleNode next public DoubleNode(int data){ this.value=data; }}public DoubleNo...

//打印两个有序链表的公共部分public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public void printCommonPart(Node head1,Node head2){ Syst...

//判断一个链表是否为回文结构//利用栈结构public boolean isPalindrome(Node head){ Stack<Node> stack=new Stack<Node>(); Node cur=head; while(cur!=null){ stack.push(cur); cur=cur....

//环形单链表的约瑟夫问题public class Node{ public int value; public Node next; public Node(int data){ this.value=data; }}public Node josephusKill(Node head,int m){ if(head==null||...

//交换单链表的相邻节点public Node swapPairs(Node head) { if(head == null||head.next==null){ return head; } Node cur = head; Node prev = cur; // 连接每对节点 if(cur.next != null...