快慢指针概念
快慢指针是指定义两个指针,这两个指针的移动速度一快一慢,以此来制造自己想要的差值,这个差值可以解决许多问题。
接下来举几个快慢指针能够解决的问题:
中间值问题
package linear;
public class FastSlowTest {
public static void main(String[] args) {
Node<String> s1 = new Node<>("one",null);
Node<String> s2 = new Node<>("two",null);
Node<String> s3 = new Node<>("three",null);
Node<String> s4 = new Node<>("four",null);
Node<String> s5 = new Node<>("five",null);
s1.next = s2;
s2.next = s3;
s3.next = s4;
s4.next = s5;
s5.next = null;
Node s = getMid(s1);
System.out.println("中间值为"+s.item);
}
public static Node getMid(Node s1){
//定义两个指针
Node fast = s1;
Node slow = s1;
//使用两个指针遍历链表,当快指针指向的结点没有下一个结点结束,这时慢指针指向的结点就是中间值
while(fast!=null && fast.next!=null) {
fast = fast.next.next;
slow = slow.next;
}
return slow;
}
//创建结点类(内部类)
private static class Node<T>{
T item;
Node next;
public Node(T item,Node next){
this.item = item;
this.next = next;
}
}
}
单链表是否有环问题
思想:
定义两个指针,一个为快指针,一个为慢指针,其中快指针的速度是慢指针的n倍(这里是两倍)。如果快指针为空或者快指针后面的元素为空说明链表有尽头,也就是没有环。如果有环,由于快指针要比慢指针要快,一直走下去,他们总有相遇的那一刻,如果他们相遇链表就是有环的。
package linear;
public class CircleListCheckTest {
public static void main(String[] args) {
Node<String> s1 = new Node<>("one",null);
Node<String> s2 = new Node<>("two",null);
Node<String> s3 = new Node<>("three",null);
Node<String> s4 = new Node<>("four",null);
Node<String> s5 = new Node<>("five",null);
Node<String> s6 = new Node<>("six",null);
Node<String> s7 = new Node<>("seven",null);
s1.next = s2;
s2.next = s3;
s3.next = s4;
s4.next = s5;
s5.next = s6;
s6.next = s7;
//下面这行代码加上有环,不加无环
s7.next = s3;
boolean b = isCircle(s1);
System.out.println(b);
}
public static boolean isCircle(Node s1){
//定义快慢指针
Node<String> fast = s1;
Node<String> slow = s1;
//遍历链表
while(fast!=null && fast.next!=null){
fast = fast.next.next;
slow = slow.next;
if(fast.equals(slow)){
return true;
}
}
return false;
}
//创建结点类(内部类)
private static class Node<T>{
T item;
Node next;
public Node(T item,Node next){
this.item = item;
this.next = next;
}
}
}
有环链表入口问题
思想:
当快慢指针相遇时,我们可以判断链表中有环,这时重新设定一个新指针指向链表的起点,且步长与慢指针一样为1,则慢指针与新指针相遇的地方就是环的入口。这里有关这个定理的证明省略。
package linear;
public class CircleListInTest {
public static void main(String[] args) {
Node<String> s1 = new Node<>("one",null);
Node<String> s2 = new Node<>("two",null);
Node<String> s3 = new Node<>("three",null);
Node<String> s4 = new Node<>("four",null);
Node<String> s5 = new Node<>("five",null);
Node<String> s6 = new Node<>("six",null);
Node<String> s7 = new Node<>("seven",null);
s1.next = s2;
s2.next = s3;
s3.next = s4;
s4.next = s5;
s5.next = s6;
s6.next = s7;
//下面这行代码加上有环,不加无环
s7.next = s3;
Node s = getEntrance(s1);
System.out.println("链表环形入口结点元素是" + s.item);
}
//找到环入口的方法
public static Node getEntrance(Node s1){
//定义快慢指针
Node<String> fast = s1;
Node<String> slow = s1;
Node<String> temp = null;
//遍历链表
while(fast!=null && fast.next!=null){
fast = fast.next.next;
slow = slow.next;
//如果快指针和慢指针相遇说明有环
if(fast.equals(slow)){
//此时让新指针指向第一个元素
temp = s1;
continue;
}
//如果新指针不空说明找到环,此时新指针需要与慢指针一起移动找环的入口
if(temp!=null){
temp = temp.next;
//判断临时指针是否和慢指针相遇
if(temp.equals(slow)){
break;
}
}
}
return temp;
}
//创建结点类(内部类)
private static class Node<T>{
T item;
Node next;
public Node(T item,Node next){
this.item = item;
this.next = next;
}
}
}