Scribd
Upload
64 views8 pages

Linked List Operations in Java

The document contains Java code for implementing a singly linked list with functionalities to insert elements at the end, at the beginning, and at a specified position. It also includes a method to display the elements of the list and a solution for detecting cycles in a linked list. The code utilizes classes for nodes and the linked list itself, along with user input for data insertion.

Uploaded by

Sudheer Pavuluri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
64 views8 pages

Linked List Operations in Java

The document contains Java code for implementing a singly linked list with functionalities to insert elements at the end, at the beginning, and at a specified position. It also includes a method to display the elements of the list and a solution for detecting cycles in a linked list. The code utilizes classes for nodes and the linked list itself, along with user input for data insertion.

Uploaded by

Sudheer Pavuluri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Insert and print the elements in the singly linked list

import [Link].*;

class Node{

int data;

Node next;

Node(int data){

[Link] = data;

[Link] = null;

class Main{

public static void main (String[] args) {

Linkedlist list = new Linkedlist();

Scanner sc = new Scanner([Link]);

while(true){

int data = [Link]();

if(data == -1){

[Link](data);

break;

[Link](data);

}
class Linkedlist{

Node head;

public void insert(int data){

Node newNode = new Node(data);

if(head==null){

head = newNode;

}else{

Node last=head;

while([Link]!=null){

last=[Link];

[Link]= newNode;

public void display(int data){

Node curr = head;

if(curr==null){

[Link]("Empty");

}else{

while(curr!=null){

[Link]([Link]);

curr = [Link];

}
}

Inserting an element at the beginning of a singly linked list:

import [Link].*;

class Node{

int data;

Node next;

Node(int data){

[Link] = data;

[Link] = null;

class Main{

public static void main (String[] args) {

Linkedlist list = new Linkedlist();

Scanner sc = new Scanner([Link]);

int data;

while(true){

data = [Link]();

if(data == -1){

break;

[Link](data);
}

int in = [Link]();

[Link](in);

[Link](data);

class Linkedlist{

Node head;

public void insert(int data){

Node newNode = new Node(data);

if(head==null){

head = newNode;

}else{

Node last=head;

while([Link]!=null){

last=[Link];

[Link]= newNode;

public void display(int data){

Node curr = head;

if(curr==null){

[Link]("Empty");
}else{

while(curr!=null){

[Link]([Link]+" ");

curr = [Link];

public void insertfirst(int in){

Node n = new Node(in);

[Link] = head;

head = n;

Inserting the element in the singly linked list at a given position


import [Link].*;
class Node{
int data;
Node next;
Node(int data){
[Link] = data;
[Link] = null;
}
}
class Main{
public static void main (String[] args) {
Scanner sc = new Scanner([Link]);
Linkedlist list = new Linkedlist();
int data;
while(true){
data = [Link]();
if(data == -1){
break;
}
[Link](data);
}
int in = [Link]();
int pos = [Link]();
[Link](in,pos);
[Link](data);
}
}
class Linkedlist{
Node head;
public void insert(int data){
Node newNode = new Node(data);
if(head==null){
head = newNode;
}else{
Node last=head;
while([Link]!=null){
last=[Link];
}
[Link]= newNode;
}
}
public void display(int data){
Node curr = head;
if(curr==null){
[Link]("Empty");
}else{
while(curr!=null){
[Link]([Link]+" ");
curr = [Link];
}
}
}
public void insertatposition(int in,int pos){
Node newnode = new Node(in);
Node temp = head;
for(int i=1;i<pos-1;i++){
temp = [Link];
}
[Link] = [Link];
[Link] = newnode;
}
}

Leetcode problem 141


public class Solution {
public boolean hasCycle(ListNode head) {
ListNode fast = head;
ListNode slow = head;
while(fast!=null && [Link]!=null){
fast = [Link];
slow = [Link];
if(slow==fast)
return true;
}
return false;
}
}

You might also like