source: https://www.hackerrank.com/challenges/30-linked-list?h_r=next-challenge&h_v=zen
import java.io.*;
import java.util.*;
class Node {
int data;
Node next;
Node(int d) {
data = d;
next = null;
}
}
class Solution {
public static Node insert(Node head,int data) {
//Complete this method
if(null == head){
head = new Node(data);
return head;
}
Node temp = head;
while(temp.next != null){
temp = temp.next;
}
temp.next = new Node(data);
return head;
}
public static void display(Node head) {
Node start = head;
while(start != null) {
System.out.print(start.data + " ");
start = start.next;
}
}
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
Node head = null;
int N = sc.nextInt();
while(N-- > 0) {
int ele = sc.nextInt();
head = insert(head,ele);
}
display(head);
sc.close();
}
}
本文提供了一个Java实现的单链表解决方案,用于解决Hackerrank上的30天挑战之链表任务。该解决方案包括插入新节点到链表尾部的方法及展示链表内容的功能。
2845

被折叠的 条评论
为什么被折叠?



