在链表中查找一个元素用顺序查找的方法

1、public class SeqSearch { public static void main(String[] args) { Node head=ListNode.getSingleList(); ListNode.printList(head); int num=9; int id=new SeqSearch().searchNumId(head,num); System.out.println("要查找的元素位置为："+id); } public int searchNumId(Node head,int num){ int id=1; while(head!=null&&head.data!=num){ head=head.next; id++; } if(head==null) id=-1; return id; }}

2、调用定义好的Node,定义如下：public class Node { int data; Node next; Node(int data){ this.data=data; }}

3、调用定义好的ListNode,定义如下：public class ListNode { public static Node getSi荏鱿胫协ngleList(){ Node head=new Node(3); Node node1=new Node(6); Node node2=new Node(8); Node node3=new Node(6); Node node4=new Node(2); head.next=node1; node1.next=node2; node2.next=node3; node3.next=node4; node4.next=null; return head; } public static void printList(Node node){ System.out.print("List:"); while(node!=null){ System.out.print(node.data+"-->"); node=node.next; } System.out.println(); }}