找到自尾节点开始的第i个节点---Java实现

import java.util.Scanner;
class Node{
	int data;
	Node next;
    Node(){;}
}
public class sslist {

	/**
	 * @param args
	 */
	public static int num = 0;
	public static Node createlist()
	{
		
		Node head = null, tail = null;
		
		Scanner input = new Scanner(System.in);
		int number = input.nextInt();
		
		while(number != -1)
		{
			if(head == null)
			{
				head = new Node();
				tail = new Node();
				head.data = number;
				head.next = null;
				tail = head;
			}
			else
			{
				Node cur = new Node();
				cur.data = number;
				tail.next = cur;
				tail = cur;
			}
			
			number = input.nextInt();
		}
		
		tail.next = null;
		input.close();
		
		Node temp = new Node();
		temp = head;
		while(temp != null)
		{
			System.out.print(temp.data+" ");
			temp = temp.next;
		}
		return head;
	}
	
	public static void printList(Node head, int i)
	{
		
		if(head != null)
		{
			printList(head.next,i);
			num++;
		}
		if(num == i)
		{
			System.out.println(head.data);
			return;
		}
			
    }
	public static void main(String[] args) {
		// TODO Auto-generated method stub
        
        System.out.println("Enter the sequence, ended with -1");
        Node head = createlist();
        printList(head,3);
	}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值