对于这个链表的学习只能用这样的笨办法,多敲几次,做到加深熟悉程度了。
昨天群里还在讨论管理,自己今天就吃了这个管理的亏的,好像无意中涉及到越权这样的事了。唉,真是惹麻烦啊。既然,骑在虎背上了,只能骑下去了。
package NOdeTest;
package NodeTest;
import org.w3c.dom.Node;
public clas LinkIsLoop{
private Node head = null;
private Node node = null;
private Node node2 = null;
private int temp;
public void LinkIsloop(Node head) {
this.head = head;
this.node = head;
this.node2 = head.next;
this.findentrance(head);
}
private void isloop(Node head2) {
// TODO Auto-generated method stub
}
private void findentrance(Node head2) {
Node node = head2;
Node node2 = node.next;
while (node != null) {
node2 = node.next;
while (node2 != null) {
if (node == node2) {
// 说明有环
System.out.println("**************链表有环!!!***********");
System.out.println("**************链表的入口是" + node.obj+"**************");
// node2.next=node;
break;
}
node2 = node2.next;
}
if (node == node2) {
break;
}
node = node.next;
}
System.out.println("****************链表没没没有环!!**************");
}
}
package NOdeTest;
package NodeTest;
import org.w3c.dom.Node;
public clas LinkIsLoop{
private Node head = null;
private Node node = null;
private Node node2 = null;
private int temp;
public void LinkIsloop(Node head) {
this.head = head;
this.node = head;
this.node2 = head.next;
this.findentrance(head);
}
private void isloop(Node head2) {
// TODO Auto-generated method stub
}
private void findentrance(Node head2) {
Node node = head2;
Node node2 = node.next;
while (node != null) {
node2 = node.next;
while (node2 != null) {
if (node == node2) {
// 说明有环
System.out.println("**************链表有环!!!***********");
System.out.println("**************链表的入口是" + node.obj+"**************");
// node2.next=node;
break;
}
node2 = node2.next;
}
if (node == node2) {
break;
}
node = node.next;
}
System.out.println("****************链表没没没有环!!**************");
}
}
package NOdeTest;
package NodeTest;
import org.w3c.dom.Node;
public clas LinkIsLoop{
private Node head = null;
private Node node = null;
private Node node2 = null;
private int temp;
public void LinkIsloop(Node head) {
this.head = head;
this.node = head;
this.node2 = head.next;
this.findentrance(head);
}
private void isloop(Node head2) {
// TODO Auto-generated method stub
}
private void findentrance(Node head2) {
Node node = head2;
Node node2 = node.next;
while (node != null) {
node2 = node.next;
while (node2 != null) {
if (node == node2) {
// 说明有环
System.out.println("**************链表有环!!!***********");
System.out.println("**************链表的入口是" + node.obj+"**************");
// node2.next=node;
break;
}
node2 = node2.next;
}
if (node == node2) {
break;
}
node = node.next;
}
System.out.println("****************链表没没没有环!!**************");
}
}